|
Search: id:A133266
|
|
|
| A133266 |
|
a(1) = 30; for n >= 2, choose smallest a(n) so that no sum of 2 or more terms equals a prime. |
|
+0
1
|
|
| 30, 32, 33, 52, 60, 63, 90, 120, 150, 180, 210, 240, 270, 300, 330, 360, 390, 420, 450, 480, 510, 540, 570, 600, 630, 660, 690, 720, 750, 780
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
(* first do *) Needs [ "Combinatorica`" ] (* then *) lst = {30}; g [ k_ ] := Block [ {j = 1, l = 2^Length@ lst}, While [ j < l && !PrimeQ [ Plus @@ NthSubset [ j, lst ] + k ], j++ ]; If [ j == l, False, True ] ]; f [ n_ ] := Block [ {k = lst [ [ -1 ] ] + 1}, While [ g@k == True, k++ ]; AppendTo [ lst, k ]; k ]; Do [ Print@ f@n, {n, 30} ]
|
|
CROSSREFS
|
Cf. A052349, A133660, A133661.
Sequence in context: A043802 A043810 A043819 this_sequence A118616 A095489 A095483
Adjacent sequences: A133263 A133264 A133265 this_sequence A133267 A133268 A133269
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 01 2008
|
|
|
Search completed in 0.002 seconds
|
