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

A335662
Numbers k such that A335660(k) = 2.
1
9, 13, 14, 15, 19, 20, 21, 44, 45, 74, 75, 109, 110, 111, 200, 201, 284, 285, 620, 621, 830, 831, 1304, 1305, 1490, 1491, 1879, 1880, 1881, 2090, 2091, 2144, 2145, 2690, 2691, 2804, 2805, 3469, 3470, 3471, 5420, 5421, 5659, 5660, 5661, 9440, 9441, 11834, 11835
OFFSET
1,1
LINKS
Altug Alkan, Andrew R. Booker, and Florian Luca, On a recursively defined sequence involving the prime counting function, arXiv:2006.08013 [math.NT], 2020.
MATHEMATICA
f[1] = 1; f[n_] := f[n] = PrimePi[n] - PrimePi[Sum[f[k], {k, 1, n - 1}]]; m = 12000 ; Position[Range[m] - Accumulate @ Array[f, m], 2] // Flatten (* Amiram Eldar, May 03 2021 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Jun 17 2020
STATUS
approved