Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026677
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026677 T(n,0) + T(n,1) + ... + T(n,n), T given by A026670. +0
2
1, 2, 5, 10, 23, 46, 103, 206, 455, 910, 1993, 3986, 8679, 17358, 37633, 75266, 162643, 325286, 701075, 1402150, 3015563, 6031126, 12948083, 25896166, 55513327, 111026654, 237705547, 475411094, 1016736115, 2033472230 (list; graph; listen)
OFFSET

0,2

FORMULA

G.f.: F(x^2) + 2xF(x^2), where xF(x) = g.f. of A054441. - Ralf Stephan, Feb 05 2004

CROSSREFS

Partial sums of A026733.

Sequence in context: A046745 A068054 A007182 this_sequence A109165 A018344 A087640

Adjacent sequences: A026674 A026675 A026676 this_sequence A026678 A026679 A026680

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research