Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025246
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025246 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4. +0
2
1, 0, 1, 1, 1, 2, 4, 7, 13, 26, 52, 104, 212, 438, 910, 1903, 4009, 8494, 18080, 38656, 82988, 178802, 386490, 837928, 1821664, 3970282, 8673258, 18987930, 41652382, 91539466, 201525238, 444379907, 981384125, 2170416738, 4806513660, 10657780276 (list; graph; listen)
OFFSET

1,6

COMMENT

Essentially the same as A023431.

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 666

FORMULA

G.f.: (1+x-sqrt(1-2*x+x^2-4*x^3))/2 - Michael Somos, Jun 08, 2000.

PROGRAM

(PARI) a(n)=polcoeff((1+x-sqrt(1-2*x+x^2-4*x^3+x*O(x^n)))/2, n)

CROSSREFS

A023431(n)=a(n+3).

Sequence in context: A099155 A068031 A023431 this_sequence A112740 A136408 A103104

Adjacent sequences: A025243 A025244 A025245 this_sequence A025247 A025248 A025249

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research