Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026523
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026523 a(n) = T(n,n-3), T given by A026519. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=3. +0
1
1, 2, 8, 16, 52, 104, 319, 635, 1910, 3786, 11304, 22344, 66514, 131264, 390266, 769578, 2286996, 4508580, 13397075, 26412001, 78489235, 154773696, 460030947, 907432695, 2697786052, 5323519838, 15830906756, 31251588060 (list; graph; listen)
OFFSET

3,2

CROSSREFS

Sequence in context: A076508 A162584 A100243 this_sequence A066792 A096195 A094014

Adjacent sequences: A026520 A026521 A026522 this_sequence A026524 A026525 A026526

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 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research