Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A146899
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A146899 A additive term polynomial as a stand alone polynomial: t0(n,m)=If[Mod[2*Binomial[n, m], 2] - Mod[Binomial[n, m], 2] == 0, Binomial[n, m]/2, Binomial[n, m] + 1]; p(x,n)=Sum[t[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]/(2*x) +0
1
1, 4, 4, 2, 3, 2, 6, 5, 5, 6, 3, 16, 10, 16, 3, 8, 22, 36, 36, 22, 8, 4, 14, 28, 35, 28, 14, 4, 10, 18, 42, 63, 63, 42, 18, 10, 5, 46, 60, 105, 126, 105, 60, 46, 5 (list; graph; listen)
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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research