The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140491 Trajectory of 2 under repeated application of the map: n -> n + third-smallest number that does not divide n. 4
 2, 7, 11, 15, 21, 26, 31, 35, 39, 44, 50, 56, 62, 67, 71, 75, 81, 86, 91, 95, 99, 104, 110, 116, 122, 127, 131, 135, 141, 146, 151, 155, 159, 164, 170, 176, 182, 187, 191, 195, 201, 206, 211, 215, 219, 224, 230, 236, 242, 247, 251, 255, 261, 266, 271, 275, 279, 284, 290, 296 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS PROG (PARI) third(n) = {my(nb = 0, k = 1); while (nb != 3, if (n % k, nb++); if (nb != 3, k++); ); k; } f(n) = n + third(n); lista2(nn) = {a = 2; print1(a, ", "); for (n=2, nn, newa = f(a); print1(newa, ", "); a = f(a); ); } \\ Michel Marcus, Oct 04 2018 CROSSREFS Cf. A140485, A140486, A140487, A140488, A140489 (second-smallest sequences). Cf. A140490, A140492, A140493, A140494 (third-smallest sequences). Sequence in context: A184485 A001960 A174008 * A122823 A063289 A287726 Adjacent sequences:  A140488 A140489 A140490 * A140492 A140493 A140494 KEYWORD nonn AUTHOR Jacques Tramu, Jun 25 2008 EXTENSIONS More terms from Michel Marcus, Oct 04 2018 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 June 23 11:29 EDT 2021. Contains 345397 sequences. (Running on oeis4.)