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.

A343041 a(0) = 0 and for any n > 0, a(n) = A343040(a(n-1), n).

Original entry on oeis.org

0, 1, 3, 3, 5, 5, 11, 11, 11, 11, 11, 11, 17, 17, 17, 17, 17, 17, 23, 23, 23, 23, 23, 23, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71
Offset: 0

Views

Author

Rémy Sigrist, Apr 03 2021

Keywords

Comments

This sequence has similarities with A087052.
If we remove duplicate terms, then we obtain A200748.
The value A200748(k) appears A130493(k) times for any k > 0.

Examples

			The first terms, in decimal and in factorial base, are:
  n   a(n)  fact(n)  fact(a(n))
  --  ----  -------  ----------
   0     0        0           0
   1     1        1           1
   2     3       10          11
   3     3       11          11
   4     5       20          21
   5     5       21          21
   6    11      100         121
   7    11      101         121
   8    11      110         121
   9    11      111         121
  10    11      120         121
  11    11      121         121
  12    17      200         221
  13    17      201         221
  14    17      210         221
		

Crossrefs

Programs

  • PARI
    See Links section.