Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026571
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026571 a(n)=T(n,n-2), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=2. +0
1
1, 2, 7, 16, 44, 106, 273, 672, 1696, 4214, 10573, 26392, 66151, 165578, 415277, 1041480, 2615004, 6568450, 16512355, 41531360, 104526093, 263206638, 663143211, 1671581968, 4215574482, 10635988422, 26846320149, 67790042264 (list; graph; listen)
OFFSET

2,2
CROSSREFS

Sequence in context: A131727 A073371 A113224 this_sequence A100099 A164267 A000512

Adjacent sequences: A026568 A026569 A026570 this_sequence A026572 A026573 A026574

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

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.