Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026539
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026539 a(n)=T(n,n-2), T given by A026536. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=2. +0
1
1, 1, 5, 8, 27, 49, 150, 284, 845, 1625, 4797, 9288, 27377, 53207, 156900, 305720, 902394, 1761882, 5205950, 10181720, 30114073, 58983859, 174609162, 342449340, 1014555607, 1992082339, 5906040623, 11608506392, 34438443075 (list; graph; listen)
OFFSET

2,3

CROSSREFS

Sequence in context: A067973 A101584 A112577 this_sequence A126700 A076593 A129774

Adjacent sequences: A026536 A026537 A026538 this_sequence A026540 A026541 A026542

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research