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.

User: Romain Pinot

Romain Pinot's wiki page.

Romain Pinot has authored 1 sequences.

A308259 a(n) is equal to the sum of the factorials of the digits of a(n-1), initial term is 3.

Original entry on oeis.org

3, 6, 720, 5043, 151, 122, 5, 120, 4, 24, 26, 722, 5044, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601, 1454, 169, 363601
Offset: 1

Author

Romain Pinot, May 17 2019

Keywords

Comments

From a(14) = 169, the sequence is stuck in the loop 363601, 1454, 169, 363601, 1454, ...

Examples

			a(5) = 151, so a(6) = 1! + 5! + 1! = 1 + 120 + 1 = 122.
		

Crossrefs

Programs

  • Mathematica
    NestList[Total@ Map[Factorial, IntegerDigits[#]] &, 3, 36] (* Michael De Vlieger, Aug 21 2023 *)