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”).
%I #24 Dec 30 2023 16:21:23
%S 1,1,1,1,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%T 2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
%U 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,1,2,2,2,2,3,2,2,2,2,2,2
%N a(n) = number of distinct primes dividing A006049(n) (and dividing A006049(n)+1).
%C a(n) first equals 3 when n is such that A006049(n) = 230.
%H Amiram Eldar, <a href="/A107800/b107800.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..2500 from T. D. Noe)
%F a(n) = A001221(A006049(n)).
%t f[n_] := Length@FactorInteger[n];t = f /@ Range[300];f /@ Flatten@Position[Rest[t] - Most[t], 0] (* _Ray Chandler_, Mar 27 2007 *)
%Y Cf. A001221, A006049, A052215.
%K nonn
%O 1,6
%A _Leroy Quet_, Mar 24 2007
%E Extended by _Ray Chandler_, Mar 27 2007