Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026521
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026521 a(n) = T(n,n-1), T given by A026519. Also a(n) = number of integer strings s(0),...,s(n), counted by T, such that s(n)=1. +0
2
1, 1, 4, 6, 19, 33, 98, 180, 526, 990, 2887, 5502, 16073, 30863, 90386, 174456, 512128, 992304, 2918954, 5673140, 16716998, 32571858, 96119927, 187675644, 554524660, 1084649644, 3208254571, 6284986554, 18607536319, 36501029265 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A026537(n+1)/2.

Sequence in context: A024874 A095383 A116383 this_sequence A006534 A064035 A010364

Adjacent sequences: A026518 A026519 A026520 this_sequence A026522 A026523 A026524

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