Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094603
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094603 a(n) is the length of the maximal sequence of rightmost black cells in the n-th row of rule 30 (begun from an initial black cell). +0
5
1, 3, 1, 4, 1, 3, 1, 6, 1, 3, 1, 4, 1, 3, 1, 7, 1, 3, 1, 4, 1, 3, 1, 6, 1, 3, 1, 4, 1, 3, 1, 9, 1, 3, 1, 4, 1, 3, 1, 6, 1, 3, 1, 4, 1, 3, 1, 7, 1, 3, 1, 4, 1, 3, 1, 6, 1, 3, 1, 4, 1, 3, 1, 15, 1, 3, 1, 4, 1, 3, 1, 6, 1, 3, 1, 4, 1, 3, 1, 7, 1, 3, 1, 4, 1, 3, 1, 6, 1, 3, 1, 4, 1, 3, 1, 9, 1, 3, 1, 4, 1, 3, 1, 6, 1 (list; graph; listen)
OFFSET

1,2

COMMENT

New numbers (A094604) in the sequence occur at positions 2^m.

REFERENCES

Wolfram, Stephen. A New Kind of Science. Wolfram Media, 2002.

LINKS

Eric Weisstein's World of Mathematics, Rule 30

CROSSREFS

Cf. A007814, A094604.

Sequence in context: A030757 A004592 A090740 this_sequence A010602 A120731 A087477

Adjacent sequences: A094600 A094601 A094602 this_sequence A094604 A094605 A094606

KEYWORD

easy,nice,nonn

AUTHOR

Eric S Rowland (erowland(AT)math.rutgers.edu), May 13 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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research