Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026585 a(n)=T(n,n), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=0. +0
3
1, 0, 2, 2, 8, 14, 40, 86, 222, 518, 1296, 3130, 7770, 19066, 47324, 117094, 291260, 724302, 1806220, 4507230, 11266718, 28188070, 70609316, 177023466, 444231564, 1115639586, 2803975860, 7052132546, 17748069294, 44693162266 (list; graph; listen)
page 1

Search completed in 0.004 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research