Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026520
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026520 a(n) = T(n,n), T given by A026519. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=0. +0
2
1, 1, 2, 4, 8, 20, 38, 104, 196, 556, 1052, 3032, 5774, 16778, 32146, 93872, 180772, 529684, 1024256, 3008864, 5837908, 17184188, 33433996, 98577712, 192239854, 567591142, 1109049320, 3278348608, 6416509142, 18986482250 (list; graph; listen)
OFFSET

0,3

CROSSREFS

For n>1, a(n) = 2*A026554(n-1).

Sequence in context: A014225 A124154 A102634 this_sequence A105319 A051389 A078006

Adjacent sequences: A026517 A026518 A026519 this_sequence A026521 A026522 A026523

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 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research