Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086394
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086394 (-1) times minimal coefficient of the polynomial (1-x)*(1-x^2)*...*(1-x^n). +0
1
1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 4, 4, 5, 5, 7, 7, 8, 10, 11, 12, 16, 19, 21, 23, 29, 34, 41, 46, 56, 68, 80, 92, 114, 135, 158, 182, 225, 269, 320, 369, 455, 544, 644, 753, 921, 1111, 1321, 1543, 1891, 2274, 2711, 3183, 3895, 4694, 5591, 6592, 8051, 9729, 11624 (list; graph; listen)
OFFSET

1,7

PROGRAM

(PARI) a(n)=-vecmin(vector(n*(n+1)/2, i, polcoeff(prod(k=1, n, 1-x^k), i))) (from Benoit Cloitre)

CROSSREFS

Cf. A086376.

Cf. A025591.

Sequence in context: A053278 A035466 A122521 this_sequence A029226 A093354 A109701

Adjacent sequences: A086391 A086392 A086393 this_sequence A086395 A086396 A086397

KEYWORD

nonn

AUTHOR

Yuval Dekel (dekelyuval(AT)hotmail.com), Sep 08 2003

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 12 2003

Further terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Sep 22 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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research