login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140492 Trajectory of 3 under repeated application of the map: n -> n + third-smallest number that does not divide n. 4

%I #8 Oct 04 2018 10:45:00

%S 3,8,14,19,23,27,32,38,43,47,51,56,62,67,71,75,81,86,91,95,99,104,110,

%T 116,122,127,131,135,141,146,151,155,159,164,170,176,182,187,191,195,

%U 201,206,211,215,219,224,230,236,242,247,251,255,261,266,271,275

%N Trajectory of 3 under repeated application of the map: n -> n + third-smallest number that does not divide n.

%t Join[{3},NestList[#+Complement[Range[#],Divisors[#]][[3]]&,8,50]] (* _Harvey P. Dale_, Apr 04 2015 *)

%o (PARI) third(n) = {my(nb = 0, k = 1); while (nb != 3, if (n % k, nb++); if (nb != 3, k++);); k;}

%o f(n) = n + third(n);

%o lista3(nn) = {a = 3; print1(a, ", "); for (n=2, nn, newa = f(a); print1(newa, ", "); a = f(a););} \\ _Michel Marcus_, Oct 04 2018

%Y Cf. A140485, A140486, A140487, A140488, A140489 (second-smallest sequences).

%Y Cf. A140490, A140491, A140493, A140494 (third-smallest sequences).

%K nonn

%O 1,1

%A _Jacques Tramu_, Jun 25 2008

%E More terms from _Harvey P. Dale_, Apr 04 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 01:40 EDT 2024. Contains 371696 sequences. (Running on oeis4.)