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!)
A071258 a(1) = 4; a(n) = smallest composite number of form k*a(n-1) + 1 with k > 1. 1

%I #6 Mar 26 2014 12:24:16

%S 4,9,28,57,115,231,694,1389,2779,5559,16678,33357,66715,133431,400294,

%T 800589,1601179,3202359,9607078,19214157,38428315,76856631,153713263,

%U 307426527,614853055,1229706111,3689118334,7378236669,14756473339

%N a(1) = 4; a(n) = smallest composite number of form k*a(n-1) + 1 with k > 1.

%H Harvey P. Dale, <a href="/A071258/b071258.txt">Table of n, a(n) for n = 0..1000</a>

%t nxt[n_]:=Module[{k=2},While[PrimeQ[k*n+1],k++];k*n+1]; NestList[nxt,4,30] (* _Harvey P. Dale_, Mar 26 2014 *)

%Y Cf. A061766, A061092, A059411.

%K nonn

%O 0,1

%A _Amarnath Murthy_, May 30 2002

%E More terms from _Vladeta Jovovic_, Jun 03 2002

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 May 8 18:04 EDT 2024. Contains 372340 sequences. (Running on oeis4.)