|
Search: id:A137850
|
|
|
| A137850 |
|
a(n) = n base 5, under morphism f(1) = 121, f(2) = 123, f(3) = 141, f(4) = 142, or 0 if n base 5 has a zero. |
|
+0
1
|
|
| 121, 123, 141, 142, 0, 121121, 121123, 121141, 121142, 0, 123121, 123123, 123141, 123142, 0, 141121, 141123, 141141, 141142, 0, 142121, 142123, 142141, 142142, 0, 0, 0, 0, 121121121, 121121123, 121121141, 121121142, 0, 121123121, 121123123
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
James Currie, Narad Rampersad, Dejean's conjecture holds for n >= 30, May 30, 2008.
|
|
FORMULA
|
a(n) = A007091(n) under the morphism f(1) = 121, f(2) = 123, f(3) = 141, f(4) = 142, or 0 if n base 5 is not a word in the alphabet {1,2,3,4}* i.e., has a zero.
|
|
CROSSREFS
|
Cf. A007091.
Sequence in context: A014734 A137517 A014735 this_sequence A036231 A055468 A134328
Adjacent sequences: A137847 A137848 A137849 this_sequence A137851 A137852 A137853
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 03 2008
|
|
|
Search completed in 0.002 seconds
|
