A137620 -id:A137620 - cp's OEIS frontend

A132018 Smallest k such that k! > A058694(n).

2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 18, 19, 21, 23, 25, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 47, 49, 51, 53, 55, 58, 60, 62, 65, 67, 70, 72, 74, 77, 79, 82, 84, 87, 90, 92, 95, 97, 100, 103, 105, 108, 111, 114, 116, 119, 122, 125, 128, 131, 134, 136

Offset: 1

R. J. Mathar, May 01 2008

nonn

Cf. A058694, A073071, A137620.

smk(n) = {lim = prod(i=1, n, numbpart(i)); k = 0; while (k! <= lim, k++); return (k);} \\ Michel Marcus, Jul 23 2013

A138945 Positive integers not in A132018.

Original entry on oeis.org

1, 9, 12, 15, 17, 20, 22, 24, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 46, 48, 50, 52, 54, 56, 57, 59, 61, 63, 64, 66, 68, 69, 71, 73, 75, 76, 78, 80, 81, 83, 85, 86, 88, 89, 91, 93, 94, 96, 98, 99, 101, 102, 104, 106, 107, 109, 110, 112, 113, 115, 117, 118, 120, 121, 123

Offset: 1

M. F. Hasler, May 04 2008

Sequence A132018 was motivated by analogy to A073071.
The latter remains quite dense in N: up to 1000 only about every 5th number is missing, which motivated to introduce its complement in N*, A138945.
While A132018 starts in a similar way, it becomes more and more sparse (since A000041 grows much faster); and consequently the present sequence becomes very dense.

Cf. A132018, A137620, A058694, A073071, A138946, A135667.

pp=1;k=0;for(n=1,999,pp*=numbpart(n);while(k++!<=pp,print1(k"," )))

cp's OEIS Frontend

A132018 Smallest k such that k! > A058694(n).

Views

Author

Keywords

Crossrefs

Programs

PARI