Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008270
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008270 Total length of strings on n symbols in Stockhausen problem. +0
1
1, 20, 507, 19552, 1113485, 88725876, 9452410135, 1299140690912, 223938108997497, 47323772172058420, 12033854264863090451, 3625294706255832787200, 1276951433895343148472517 (list; graph; listen)
OFFSET

1,2

REFERENCES

R. C. Read, Combinatorial problems in theory of music, Discrete Math. 167 (1997), 543-551.

Read, Ronald C. and Yen, Lily, A note on the Stockhausen problem, J. Comb. Theory, Ser. A 76, No. 1, 1-10.

CROSSREFS

Sequence in context: A000827 A118552 A092087 this_sequence A130186 A130033 A047682

Adjacent sequences: A008267 A008268 A008269 this_sequence A008271 A008272 A008273

KEYWORD

nonn

AUTHOR

Lily Yen [ lyen(AT)jeeves.uwaterloo.ca ]

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 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research