Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026587 a(n)=T(n,n-2), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=2. +0
1
1, 1, 5, 9, 28, 62, 167, 399, 1024, 2518, 6359, 15819, 39759, 99427, 249699, 626203, 1573524, 3953446, 9943905, 25019005, 62994733, 158680545, 399936573, 1008438757, 2543992514, 6420413940, 16210331727, 40943722115, 103453402718 (list; graph; listen)
OFFSET

2,3

CROSSREFS

Sequence in context: A034498 A048884 A077915 this_sequence A147367 A147230 A163779

Adjacent sequences: A026584 A026585 A026586 this_sequence A026588 A026589 A026590

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