cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A086358 Digital root of n!.

Original entry on oeis.org

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
Offset: 0

Views

Author

Labos Elemer, Jul 21 2003

Keywords

Comments

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

Examples

			n = 5, 5 != 120, iteration list = {120,3}, a(5) = 3.
		

Crossrefs

Programs

  • Mathematica
    sud[x_] := Apply[Plus, DeleteCases[IntegerDigits[x], 0]]; Table[FixedPoint[sud, w!], {w, 1, 87}]

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

Extensions

a(0) = 1 prepended by Alois P. Heinz, Dec 05 2018