This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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 LINKS 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 Cf. A010888, A038194, A258876, A258877, A259040. Sequence in context: A108272 A121999 A069530 * A087144 A114616 A166311 Adjacent sequences:  A259029 A259030 A259031 * A259033 A259034 A259035 KEYWORD nonn,base AUTHOR Zak Seidov, Jun 17 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 04:40 EDT 2019. Contains 328211 sequences. (Running on oeis4.)