Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A093655
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A093655 First column of lower triangular matrix A093654. +0
5
1, 1, 1, 2, 1, 2, 2, 7, 1, 2, 2, 7, 2, 7, 7, 41, 1, 2, 2, 7, 2, 7, 7, 41, 2, 7, 7, 41, 7, 41, 41, 397, 1, 2, 2, 7, 2, 7, 7, 41, 2, 7, 7, 41, 7, 41, 41, 397, 2, 7, 7, 41, 7, 41, 41, 397, 7, 41, 41, 397, 41, 397, 397, 6377 (list; graph; listen)
OFFSET

1,4

COMMENT

Related to the number of tournament sequences (A008934).

a(n) equals the number of tournament sequences (A008934) of length A000120(n-1), which is the number of 1's in the binary expansion of n-1.

FORMULA

a(2^n) = A008934(n) for n>=0.

a(n) = A008934(A000120(n-1)) for n>=1.

CROSSREFS

Cf. A008934, A093655.

Cf. A000120.

Sequence in context: A081727 A000020 A077014 this_sequence A023140 A145859 A145863

Adjacent sequences: A093652 A093653 A093654 this_sequence A093656 A093657 A093658

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Apr 08 2004

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 December 20 13:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research