Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082458
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082458 Multiply by 1, add 1, multiply by 2, add 2, etc. +0
1
0, 0, 1, 2, 4, 12, 15, 60, 64, 320, 325, 1950, 1956, 13692, 13699, 109592, 109600, 986400, 986409, 9864090, 9864100, 108505100, 108505111, 1302061332, 1302061344, 16926797472, 16926797485, 236975164790, 236975164804 (list; graph; listen)
OFFSET

0,4

COMMENT

Bisections: A007526 and A038154.

FORMULA

For n>=2, a(2n)=floor(e*n!)-1, a(2*n+1)=(n+1)*(floor(e*n!)-1). - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 28 2003

PROGRAM

(PARI) a(n)=if(n<2, 0, if(n%2, (n+1)/2*(floor(exp(1)*((n-1)/2)!)-1), floor(exp(1)*(n/2)!)-1))

CROSSREFS

Cf. A019464 - A019466.

Cf. A082448.

Sequence in context: A107295 A039564 A067268 this_sequence A114064 A071118 A132314

Adjacent sequences: A082455 A082456 A082457 this_sequence A082459 A082460 A082461

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 25 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research