|
Search: id:A083744
|
|
|
| A083744 |
|
a(1) = 1; if a(n-1) + n is composite then a(n) = a(n-1) + n, else a(n) = a(n-1). |
|
+0
2
|
|
| 1, 1, 4, 8, 8, 14, 21, 21, 30, 40, 51, 63, 76, 90, 105, 121, 138, 156, 175, 195, 216, 238, 261, 285, 310, 336, 363, 391, 420, 450, 481, 513, 546, 580, 615, 651, 688, 726, 765, 805, 846, 888, 931, 975, 1020, 1066, 1113, 1161, 1210, 1260, 1311, 1363, 1416, 1470
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
MAPLE
|
a := proc(n) option remember: if n=1 then RETURN(1) fi: if isprime(a(n-1)+n) then RETURN(a(n-1)) else RETURN(a(n-1)+n) fi: end: for n from 1 to 100 do printf(`%d, `, a(n)) od:
|
|
CROSSREFS
|
Cf. A083743.
Sequence in context: A098352 A014198 A159786 this_sequence A114027 A005877 A098354
Adjacent sequences: A083741 A083742 A083743 this_sequence A083745 A083746 A083747
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 05 2003
|
|
EXTENSIONS
|
More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), May 19, 2003
|
|
|
Search completed in 0.002 seconds
|
