Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026861
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026861 T(2n,n+1), T given by A026747. +0
1
1, 5, 22, 95, 411, 1790, 7855, 34725, 154573, 692450, 3120206, 14135555, 64356345, 294341325, 1351889910, 6233399525, 28845511125, 133933280000, 623811120960, 2913924782375, 13648296620445, 64087737455725, 301644762913977 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n+1)=p(n+1) where p(x) is the unique degree-n polynomial such that p(k)=A002212(k+1) for k=0,1,...,n. - Michael Somos, Oct 07 2003

PROGRAM

(PARI) a(n)=if(n<1, 0, subst(polinterpolate(Vec((1-3*x-sqrt(1-6*x+5*x^2+x^2*O(x^n)))/2)), x, n+1))

CROSSREFS

Sequence in context: A141222 A127360 A116415 this_sequence A026888 A083586 A129158

Adjacent sequences: A026858 A026859 A026860 this_sequence A026862 A026863 A026864

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 August 29 14:50 EDT 2008. Contains 143238 sequences.


AT&T Labs Research