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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082448 Add 1, multiply by 1, add 2, multiply by 2, etc. 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; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..28.

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

PROG

(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: A110883 A178131 A071570 * A190796 A070783 A198334

Adjacent sequences:  A082445 A082446 A082447 * A082449 A082450 A082451

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, based on a suggestion of Nick MacDonald, Apr 25 2003

EXTENSIONS

More terms from Benoit Cloitre, Apr 26 2003

STATUS

approved

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

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

Last modified December 18 17:57 EST 2014. Contains 252173 sequences.