Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154413
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154413 Maximal Eulerian numbers A006551 minus A018224: a(n)=Eulerian[n,Floor[n/2]]-Binomial[n,Floor[n/2]]^2=A006551(n)-A018224(n). +0
1
0, 0, 0, 2, 30, 202, 2016, 14394, 151290, 1294478, 15660744, 162298842, 2274318228, 27968231436, 447527038848, 6382757516250, 114890215021650, 1865385066804550, 37307710791708600, 679562209260462054 (list; graph; listen)
OFFSET

0,4

FORMULA

a(n)=Eulerian[n,Floor[n/2]]-Binomial[n,Floor[n/2]]^2=A006551(n)-A018224(n).

MATHEMATICA

t[n_, k_] = Sum[(-1)^j Binomial[n + 1, j](k + 1 - j)^n, {j, 0, k + 1}];

a0 = Table[t[n, Floor[n/2]], {n, 1, 30}];

b0 = Table[Binomial[n, Floor[(n)/2]]^2, {n, 0, 29}];

a=a0-b0

CROSSREFS

A006551,A018224.

Sequence in context: A157870 A078838 A089288 this_sequence A007030 A157054 A092355

Adjacent sequences: A154410 A154411 A154412 this_sequence A154414 A154415 A154416

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 09 2009

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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research