Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026522
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026522 T(n,n-2), T given by A026519. Also number of integer strings s(0),...,s(n), counted by T, such that s(n)=2. +0
1
1, 2, 5, 13, 27, 76, 150, 434, 845, 2470, 4797, 14085, 27377, 80584, 156900, 462620, 902394, 2664276, 5205950, 15387670, 30114073, 89097932, 174609162, 517058502, 1014555607, 3006637946, 5906040623, 17514547015, 34438443075 (list; graph; listen)
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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research