Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026569
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026569 a(n)=T(n,n), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=0. +0
7
1, 1, 3, 5, 13, 27, 67, 153, 375, 893, 2189, 5319, 13089, 32155, 79479, 196573, 487833, 1212135, 3018355, 7525585, 18792303, 46980373, 117589689, 294613155, 738844719, 1854484305, 4658460165, 11710592711, 29458662005, 74151824271 (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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research