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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A334216 a(n) is the number of distinct terms in the n-th row of A334215. 2
1, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 3, 2, 2, 2, 4, 2, 3, 2, 3, 2, 2, 2, 3, 3, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 3, 5, 2, 2, 2, 3, 2, 2, 2, 4, 2, 2, 3, 3, 2, 2, 2, 4, 4, 2, 2, 3, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) <= A000005(n).
a(p^k) = A000267(k) for any k >= 0 and prime number p.
PROG
(PARI) a(n) = { my (f=factor(n)); #Set(apply (k -> prod (i=1, #f~, f[i, 1]^(f[i, 2]\k)), [1..1+if (n==1, 0, vecmax(f[, 2]~))])) }
CROSSREFS
Sequence in context: A278744 A346213 A082091 * A100549 A085962 A160821
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Apr 19 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:07 EDT 2024. Contains 371905 sequences. (Running on oeis4.)