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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A302037 A bigomega (A001222) analog based on the Ludic sieve (A255127): a(1) = 0; for n > 1, a(n) = 1 + a(A302032(n)). 6

%I #8 Apr 06 2018 10:16:15

%S 0,1,1,2,1,2,1,3,2,2,1,3,1,2,2,4,1,3,2,3,3,2,1,4,1,2,2,3,1,3,2,5,3,2,

%T 2,4,1,3,2,4,1,4,1,3,4,2,1,5,3,2,3,3,1,3,2,4,3,2,2,4,1,3,2,6,2,4,1,3,

%U 4,3,1,5,2,2,2,4,1,3,3,5,3,2,1,5,3,2,3,4,1,5,1,3,5,2,2,6,1,4,2,3,2,4,2,4,4

%N A bigomega (A001222) analog based on the Ludic sieve (A255127): a(1) = 0; for n > 1, a(n) = 1 + a(A302032(n)).

%H Antti Karttunen, <a href="/A302037/b302037.txt">Table of n, a(n) for n = 1..32768</a>

%H <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>

%F a(1) = 0; for n > 1, a(n) = 1 + a(A302032(n)).

%F a(n) = A000120(A269388(n)).

%F a(n) = A001222(A302026(n)).

%o (PARI)

%o \\ Assuming that A269379 and A269380 have been precomputed:

%o A302032(n) = if(1==n,n,my(k=0); while((n%2), n = A269380(n); k++); n = n/2; while(k>0, n = A269379(n); k--); (n));

%o A302037(n) = if(1==n,0,1+A302037(A302032(n)));

%Y Cf. A302026, A302032.

%Y Cf. A003309 (gives the positions of terms <= 1), A302038 (gives the positions of 2's).

%Y Cf. A302031 (an omega-analog), A253557.

%K nonn

%O 1,4

%A _Antti Karttunen_, Apr 01 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 23:03 EDT 2024. Contains 376002 sequences. (Running on oeis4.)