Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026554
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026554 a(n)=T(n,n-1), T given by A026552. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=1. +0
2
1, 2, 4, 10, 19, 52, 98, 278, 526, 1516, 2887, 8389, 16073, 46936, 90386, 264842, 512128, 1504432, 2918954, 8592094, 16716998, 49288856, 96119927, 283795571, 554524660, 1639174304, 3208254571, 9493241125, 18607536319, 55108565584 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Equals A026520(n+1)/2.

Sequence in context: A043330 A011963 A083844 this_sequence A099413 A127392 A004647

Adjacent sequences: A026551 A026552 A026553 this_sequence A026555 A026556 A026557

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research