Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046919
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046919 Maximal coefficient of polynomial p(n), with p(3)=1, p(n) = (1 - t^(2*n - 4))*(1 - t^(2*n - 3))*p(n - 1)/((1 - t^(n - 3))*(1 - t^n)). +0
2
1, 1, 3, 8, 24, 73, 227, 734, 2430, 7684, 17516, 31162, 47180, 64018, 80423, 95589, 109090, 120784 (list; graph; listen)
OFFSET

3,3

REFERENCES

J. Riordan, The number of score sequences in tournaments, J. Combin. Theory, 5 (1968), 87-89.

EXAMPLE

1; 1+t+t^2+t^3+t^4+t^5, t^10+t^9+2*t^8+2*t^7+3*t^6+3*t^5+3*t^4+2*t^3+2*t^2+t+1, ...

MAPLE

p := proc(n) option remember; if n = 3 then 1 else (1-t^(2*n-4))*(1-t^(2*n-3))*p(n-1)/((1-t^(n-3))*(1-t^n)); fi; end;

for i from 3 to 20 do L[ i ] := seriestolist(series(simplify(p(i)), t, 50)); lprint(max(op(L[ i ])); od:

CROSSREFS

Cf. A046918.

Sequence in context: A080923 A118264 A006365 this_sequence A046342 A000958 A084205

Adjacent sequences: A046916 A046917 A046918 this_sequence A046920 A046921 A046922

KEYWORD

nonn,easy,nice

AUTHOR

njas

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 8 18:40 EDT 2008. Contains 141013 sequences.


AT&T Labs Research