Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057553 Rank of (1,1,...,1) (n 1's) when {0,1,2,...}^n is lexicographically ordered. +0
1
1, 5, 16, 56, 203, 749, 2795, 10517, 39832, 151658, 579956, 2225964, 8570330, 33086030, 128028650, 496432760, 1928418395, 7503144365, 29235705215, 114064338335, 445552419545, 1742264571605, 6819546853625, 26717004445325 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=C(2n-1, n)+b(n-2)+1, where b=A057552.

EXAMPLE

For n=3, the ordering starts (0,0,0), (0,0,1), ... and the 15th term is (1,1,1).

CROSSREFS

Adjacent sequences: A057550 A057551 A057552 this_sequence A057554 A057555 A057556

Sequence in context: A089102 A098912 A120343 this_sequence A006217 A116914 A047103

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Sep 07 2000

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 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research