cp's OEIS Frontend

A302031 An omega (A001221) analog based on the Ludic sieve (A255127): a(1) = 0; for n > 1, a(n) = 1 + a(A302034(n)).

%I A302031 #7 Apr 06 2018 10:15:28
%S A302031 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,
%T A302031 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,
%U A302031 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
%N A302031 An omega (A001221) analog  based on the Ludic sieve (A255127): a(1) = 0; for n > 1, a(n) = 1 + a(A302034(n)).
%H A302031 Antti Karttunen, <a href="/A302031/b302031.txt">Table of n, a(n) for n = 1..32768</a>
%H A302031 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%F A302031 a(1) = 0; for n > 1, a(n) = 1 + a(A302034(n)).
%F A302031 a(n) = A001221(A302026(n)).
%F A302031 a(n) = A069010(A269388(n)).
%o A302031 (PARI)
%o A302031 \\ Assuming that A269379 and A269380 have been precomputed:
%o A302031 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));
%o A302031 A302031(n) = if(1==n,0,1+A302031(A302034(n)));
%Y A302031 Cf. A001221, A302026, A302037, A302041,
%Y A302031 Cf. A302036 (positions of terms < 2).
%Y A302031 Differs from similar A302041 for the first time at n=59, where a(59) = 2, while A302041(59) = 1.
%K A302031 nonn
%O A302031 1,6
%A A302031 _Antti Karttunen_, Apr 02 2018