|
Search: id:A082448
|
|
|
| A082448 |
|
Add 1, multiply by 1, add 2, multiply by 2, etc. |
|
+0
4
|
|
| 4, 5, 5, 7, 14, 17, 51, 55, 220, 225, 1125, 1131, 6786, 6793, 47551, 47559, 380472, 380481, 3424329, 3424339, 34243390, 34243401, 376677411, 376677423, 4520129076, 4520129089, 58761678157, 58761678171, 822663494394
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Nick Hobson, Python program for this sequence
|
|
FORMULA
|
For n>=2, a(2n)=floor((2e+4)*n!)-n-2, a(2n+1)=floor((2e+4)*n!)-1.
|
|
MATHEMATICA
|
k = 0; NestList[(k++; {Last@# + k, k(k + Last@#)}) &, {4}, 16] // Flatten
|
|
PROGRAM
|
(PARI) a=4; for(n=1, 150, print(a, ", "); b=if(n%2-1, a*ceil(n/2), a+ceil(n/2)); a=b)
|
|
CROSSREFS
|
Cf. A019461, A019463, A019460, A019462.
Sequence in context: A028276 A110883 A071570 this_sequence A070783 A055593 A088245
Adjacent sequences: A082445 A082446 A082447 this_sequence A082449 A082450 A082451
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, based on a suggestion of Nick MacDonald, Apr 25 2003
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 26 2003
|
|
|
Search completed in 0.002 seconds
|
