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

A259032
Numbers n such that digital root of n is 2*(digital root of n-th prime).
2
29, 38, 40, 44, 49, 80, 143, 148, 166, 191, 197, 233, 251, 269, 272, 283, 305, 314, 326, 335, 364, 371, 373, 389, 425, 427, 431, 461, 470, 497, 515, 517, 553, 557, 562, 602, 614, 616, 625, 634, 638, 647, 652, 656, 659, 661, 677, 683, 692, 731, 749, 758, 800, 812, 845, 863, 908
OFFSET
1,1
COMMENTS
Corresponding primes:
109, 163, 173, 193, 227, 409, 823, 857, 983, 1153, 1201, 1471, 1597, 1723, 1747, 1847, 2011, 2083, 2161, 2251, 2459, 2539, 2549, 2683, 2953, 2963, 3001, 3259, 3331, 3547, 3691, 3701, 4007, 4027, 4079, 4423, 4519, 4547, 4637, 4691, 4729, 4801, 4871, 4909, 4933, 4943, 5059, 5107, 5197.
Conjecture: a(n) ~ 18n. - Charles R Greathouse IV, Jun 18 2015
MATHEMATICA
Reap[Do[If[FixedPoint[Total[IntegerDigits[#]]&, n]==2*Mod[Prime[n], 9], Sow[n]], {n, 1000}]][[2, 1]]
Select[Range@ 1000, FixedPoint[Total@ IntegerDigits@ # &, #] == 2 FixedPoint[Total@ IntegerDigits@ # &, Prime@ #] &] (* Michael De Vlieger, Jun 19 2015 *)
PROG
(PARI) n=0; forprime(p=2, 1e4, if(p%9*2==n++%9, print1(n", "))) \\ Charles R Greathouse IV, Jun 18 2015
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Zak Seidov, Jun 17 2015
STATUS
approved