Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026557
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026557 a(n)=T(n,n-4), T given by A026552. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4. +0
1
1, 3, 12, 28, 93, 201, 631, 1316, 4037, 8259, 25052, 50680, 152782, 306958, 921982, 1844304, 5526849, 11024331, 32987492, 65675764, 196323853, 390374193, 1166171943, 2316881892, 6918228187, 13737041045, 41007165500 (list; graph; listen)
OFFSET

4,2

CROSSREFS

Sequence in context: A115549 A005995 A034503 this_sequence A124052 A104353 A001860

Adjacent sequences: A026554 A026555 A026556 this_sequence A026558 A026559 A026560

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