The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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

%I

%S 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,

%T 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,

%U 2,2,2,4,2,2,3,3,2,2,2,4,4,2,2,3,2,2,2

%N a(n) is the number of distinct terms in the n-th row of A334215.

%F a(n) <= A000005(n).

%F a(p^k) = A000267(k) for any k >= 0 and prime number p.

%o (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]~))])) }

%Y Cf. A000005, A000267, A334215, A334217.

%K nonn

%O 1,2

%A _Rémy Sigrist_, Apr 19 2020

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

Last modified September 16 08:18 EDT 2021. Contains 347469 sequences. (Running on oeis4.)