Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026553 a(n)=T(n,n), T given by A026552. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=0. +0
1
1, 1, 3, 4, 12, 20, 58, 104, 300, 556, 1608, 3032, 8806, 16778, 48924, 93872, 274644, 529684, 1553940, 3008864, 8846772, 17184188, 50618184, 98577712, 290817566, 567591142, 1676640462, 3278348608, 9694857750, 18986482250 (list; graph; listen)
OFFSET

0,3
CROSSREFS

Sequence in context: A124818 A124638 A124639 this_sequence A101727 A075220 A075221

Adjacent sequences: A026550 A026551 A026552 this_sequence A026554 A026555 A026556

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

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.