|
Search: id:A006715
|
|
|
| A006715 |
|
Describe the previous term! (method A - initial term is 3).
(Formerly M2965)
|
|
+0
22
|
|
| 3, 13, 1113, 3113, 132113, 1113122113, 311311222113, 13211321322113, 1113122113121113222113, 31131122211311123113322113, 132113213221133112132123222113
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Method A = 'frequency' followed by 'digit'-indication.
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
J. H. Conway, The weird and wonderful chemistry of audioactive decay, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 173-188.
S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 452-455.
I. Vardi, Computational Recreations in Mathematica. Addison-Wesley, Redwood City, CA, 1991, p. 4.
|
|
LINKS
|
S. R. Finch, Conway's Constant
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
EXAMPLE
|
E.g. the term after 3113 is obtained by saying "one 3, two 1's, one 3", which gives 132113.
|
|
MATHEMATICA
|
RunLengthEncode[ x_List ] := (Through[ {First, Length}[ #1 ] ] &) /@ Split[ x ]; LookAndSay[ n_, d_:1 ] := NestList[ Flatten[ Reverse /@ RunLengthEncode[ # ] ] &, {d}, n - 1 ]; F[ n_ ] := LookAndSay[ n, 3 ][ [ n ] ]; Table[ FromDigits[ F[ n ] ], {n, 1, 11} ] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 21 2007
|
|
CROSSREFS
|
Cf. A001155, A005150, A006751, A001140, A001141, A001143, A001145, A001151, A001154.
Sequence in context: A092540 A118628 A112513 this_sequence A138487 A022507 A108583
Adjacent sequences: A006712 A006713 A006714 this_sequence A006716 A006717 A006718
|
|
KEYWORD
|
nonn,base,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
