cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A302037 #8 Apr 06 2018 10:16:15
%S A302037 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 A302037 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 A302037 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 A302037 A bigomega (A001222) analog  based on the Ludic sieve (A255127): a(1) = 0; for n > 1, a(n) = 1 + a(A302032(n)).
%H A302037 Antti Karttunen, <a href="/A302037/b302037.txt">Table of n, a(n) for n = 1..32768</a>
%H A302037 <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>
%F A302037 a(1) = 0; for n > 1, a(n) = 1 + a(A302032(n)).
%F A302037 a(n) = A000120(A269388(n)).
%F A302037 a(n) = A001222(A302026(n)).
%o A302037 (PARI)
%o A302037 \\ Assuming that A269379 and A269380 have been precomputed:
%o A302037 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 A302037(n) = if(1==n,0,1+A302037(A302032(n)));
%Y A302037 Cf. A302026, A302032.
%Y A302037 Cf. A003309 (gives the positions of terms <= 1), A302038 (gives the positions of 2's).
%Y A302037 Cf. A302031 (an omega-analog), A253557.
%K A302037 nonn
%O A302037 1,4
%A A302037 _Antti Karttunen_, Apr 01 2018