Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026388
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026388 a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=2; also a(n) = T(2n,n-1). +0
2
1, 5, 24, 114, 541, 2573, 12275, 58747, 282003, 1357407, 6549906, 31675020, 153481299, 745011075, 3622111560, 17635418730, 85975792075, 419644943495, 2050493623760, 10029194506990, 49098707209695, 240568930012575 (list; graph; listen)
OFFSET

1,2
CROSSREFS

Sequence in context: A079028 A141223 A140766 this_sequence A057969 A004254 A086347

Adjacent sequences: A026385 A026386 A026387 this_sequence A026389 A026390 A026391

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.005 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 08:07 EST 2009. Contains 170310 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.