login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A302031
An omega (A001221) analog based on the Ludic sieve (A255127): a(1) = 0; for n > 1, a(n) = 1 + a(A302034(n)).
6
0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 2, 3, 1, 2, 2, 1, 2, 3, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 3, 2, 2, 2
OFFSET
1,6
FORMULA
a(1) = 0; for n > 1, a(n) = 1 + a(A302034(n)).
a(n) = A001221(A302026(n)).
a(n) = A069010(A269388(n)).
PROG
(PARI)
\\ Assuming that A269379 and A269380 have been precomputed:
A302034(n) = if(1==n, n, my(k=0); while((n%2), n = A269380(n); k++); n = (n/2^valuation(n, 2)); while(k>0, n = A269379(n); k--); (n));
A302031(n) = if(1==n, 0, 1+A302031(A302034(n)));
CROSSREFS
Cf. A302036 (positions of terms < 2).
Differs from similar A302041 for the first time at n=59, where a(59) = 2, while A302041(59) = 1.
Sequence in context: A062893 A328512 A302041 * A371883 A237353 A293460
KEYWORD
nonn
AUTHOR
Antti Karttunen, Apr 02 2018
STATUS
approved