Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082430
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082430 a(1)=1, a(n)=n*(a(n-1)+a(n-2)+...+a(2)+a(1)) + 4. +0
1
1, 6, 25, 132, 824, 5932, 48444, 442916, 4484524, 49828044, 602919332, 7892762164, 111156400476, 1675896499484, 26934050884564, 459674468429892, 8302870086014924, 158242935756990316, 3173649989348528004 (list; graph; listen)
OFFSET

1,2

COMMENT

More generally if m is an integer and a(1)=1, a(n)=n*(a(n-1)+a(n-2)+...+a(2)+a(1)) + m then a(n) has a closed form formula as : a(n)=floor/ceil(n*r(m)*n!) where r(m)=frac(e*m) + 0 or + 1/2 or -1/2 + integer. Ex : r(10)=frac(10*e)+1/2+2; r(12)=frac(12*e)-1/2+3; r(15)=frac(15*e)+3; r(18)=frac(18*e)-1/2+4 ...

FORMULA

for n>=2 a(n) = ceiling(n*(19/2-4e)*n!)

CROSSREFS

Cf. A007808, A074143.

Adjacent sequences: A082427 A082428 A082429 this_sequence A082431 A082432 A082433

Sequence in context: A120758 A099359 A073967 this_sequence A136593 A012293 A012594

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 24 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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research