|
Search: id:A100531
|
|
|
| A100531 |
|
a(n) = a(n-1)+Mod[2*n-1,8]+1;a(0)=1. |
|
+0
1
|
|
| 1, 3, 7, 13, 21, 23, 27, 33, 41, 43, 47, 53, 61, 63, 67, 73, 81, 83, 87, 93, 101, 103, 107, 113, 121, 123, 127, 133, 141, 143, 147, 153, 161, 163, 167, 173, 181, 183, 187, 193, 201, 203, 207, 213, 221, 223, 227, 233, 241, 243, 247, 253, 261, 263, 267, 273, 281, 283
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Numbers == 1,3,7,13 modulo 20. - Ralf Stephan, May 15 2007
|
|
MATHEMATICA
|
digits=200 f[n_]:=f[n]=f[n-1]+Mod[2*n-1, 8]+1 f[0]=1; a=Table[f[n], {n, 1, digits}]
|
|
CROSSREFS
|
Sequence in context: A033154 A076950 A069194 this_sequence A032409 A073896 A077853
Adjacent sequences: A100528 A100529 A100530 this_sequence A100532 A100533 A100534
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 24 2004
|
|
|
Search completed in 0.002 seconds
|
