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”).

A215113
a(n) is the number of different prime divisors of A214723(n).
2
1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 3, 2, 3, 1, 2, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 3, 2, 2, 2, 2, 2, 3, 1, 3, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 3
OFFSET
1,3
COMMENTS
The records of a(n) are a(1)=1, a(3)=2, a(12)=3, a(132)=4,... Is the sequence unbounded?
LINKS
FORMULA
a(n) = A001221(A214723(n)). - Michel Marcus, Feb 08 2016
MATHEMATICA
nn = 2000; ps = Prime[Range[PrimePi[Sqrt[nn]]]]; t = Flatten[Table[ ps[[i]]^2 + ps[[j]]^2, {i, Length[ps]}, {j, i, Length[ps]}]]; t =
Select[t, # <= nn &]; PrimeNu[Sort[Transpose[Select[Tally[t], #[[2]] == 1 &]][[1]]]] (* G. C. Greubel, May 16 2017 *)
CROSSREFS
Sequence in context: A114284 A238303 A023575 * A058978 A105446 A367817
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Aug 03 2012
STATUS
approved