Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026389
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026389 a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=4; also a(n) = T(2n,n-2). +0
2
1, 8, 49, 272, 1440, 7428, 37730, 189808, 948909, 4724160, 23453001, 116207424, 575036475, 2842936320, 14046869575, 69378730880, 342590699955, 1691519468760, 8351553940355, 41235710124400, 203617691311370, 1005560117623204 (list; graph; listen)
OFFSET

2,2

COMMENT

Binomial transform of A002694. - Ross La Haye (rlahaye(AT)new.rr.com), Mar 05 2005

CROSSREFS

Adjacent sequences: A026386 A026387 A026388 this_sequence A026390 A026391 A026392

Sequence in context: A080493 A018200 A081901 this_sequence A005059 A026719 A026774

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research