A086358 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A086358

Digital root of n!.

1, 1, 2, 6, 6, 3, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

a(n) = 9 for n >= 6.

LINKS

Table of n, a(n) for n=0..105.

Index entries for linear recurrences with constant coefficients, signature (1).

FORMULA

a(n) = A010888(n!) = fixed-point of A007953(n!). It equals n! modulo(9); at r = 0 use 9.

G.f.: (1 + x^2 + 4*x^3 - 3*x^5 + 6*x^6)/(1 - x). - Stefano Spezia, Jan 26 2023

EXAMPLE