|
Search: id:A095345
|
|
| |
|
| 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
This is the first sequence reached in the infinite process described in A066983 comment line.
|
|
EXAMPLE
|
A095346 begins : 3,1,3,1,1,1,3,1,3,1,1,1,3,1,1,1,.. and length or runs of 3's and 1's are 1,1,1,3,1,1,1,3,1,3,...
|
|
CROSSREFS
|
Cf. A064353, A095343, A095344, A095346.
Sequence in context: A087612 A051997 A086869 this_sequence A132468 A090176 A102396
Adjacent sequences: A095342 A095343 A095344 this_sequence A095346 A095347 A095348
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 03 2004
|
|
|
Search completed in 0.002 seconds
|