Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102433
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102433 Number of distinct polynomials of degree < n and coefficients > 0 with solutions k >= 1 such that p(k) = n. +0
5
1, 4, 12, 40, 132, 472, 1727, 6452, 24330, 92404, 352743, 1352116, 5200339, 20058347, 77558811, 300540260, 1166803176, 4537567732, 17672631983, 68923264512, 269128937327, 1052049481983, 4116715363924, 16123801841703 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = A102431(n) + A102430(n, 1) - 1

EXAMPLE

a(2)=4 distinct polynomials: 2 (for all n), n+1, 2n (for n=1), n (for n=2).

CROSSREFS

Cf. A102430, A102431, A102432, A102434.

Sequence in context: A152174 A087206 A081875 this_sequence A100320 A064649 A149332

Adjacent sequences: A102430 A102431 A102432 this_sequence A102434 A102435 A102436

KEYWORD

easy,nonn

AUTHOR

Marc LeBrun (mlb(AT)well.com), Jan 08 2005

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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research