login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073669 a(1) = 1, a(n) = the smallest composite multiple of n such that every partial sum is prime. 1
1, 4, 6, 8, 10, 12, 42, 24, 72, 20, 132, 36, 52, 14, 30, 16, 68, 54, 76, 80, 126, 88, 92, 24, 100, 26, 108, 112, 116, 30, 310, 128, 66, 204, 70, 36, 74, 76, 78, 120, 902, 84, 430, 44, 360, 460, 188, 240, 294, 100, 204, 104, 106, 54, 110, 280, 342, 116, 708, 60, 244, 62 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

MAPLE

a[1] := 1:su := 1:for n from 2 to 112 do i := 1: if(isprime(n)) then i := i+1:fi:while(not isprime(i*n+su)) do i := i+1:od:a[n] := i*n:su := su+a[n]:od:seq(a[j], j=1..112);

MATHEMATICA

a[1]=s[1]=1; s[n_] := s[n]=s[n-1]+a[n]; a[n_] := a[n]=For[i=1, True, i++, If[ !PrimeQ[i*n]&&PrimeQ[s[n-1]+i*n], Return[i*n]]]

CROSSREFS

Sequence in context: A053012 A096160 A181055 * A073670 A090169 A190330

Adjacent sequences:  A073666 A073667 A073668 * A073670 A073671 A073672

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 11 2002

EXTENSIONS

Corrected and extended by Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 30 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.