Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026537
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026537 a(n)=T(n,n), T given by A026536. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=0. +0
2
1, 0, 2, 2, 8, 12, 38, 66, 196, 360, 1052, 1980, 5774, 11004, 32146, 61726, 180772, 348912, 1024256, 1984608, 5837908, 11346280, 33433996, 65143716, 192239854, 375351288, 1109049320, 2169299288, 6416509142, 12569973108 (list; graph; listen)
OFFSET

0,3

CROSSREFS

Equals 2 * A026521(n-1).

Sequence in context: A053414 A014236 A087955 this_sequence A089248 A006663 A094941

Adjacent sequences: A026534 A026535 A026536 this_sequence A026538 A026539 A026540

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research