|
Search: id:A111864
|
|
|
| A111864 |
|
Define the first three terms to be 1, 1 and 1. All the other terms are obtained by concatenating the three previous terms. |
|
+0
1
|
|
| 1, 1, 1, 111, 11111, 111111111, 11111111111111111, 1111111111111111111111111111111, 111111111111111111111111111111111111111111111111111111111
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
a(n) = A002275(A000213(n)), the repunits with the property that their number of digits is a tribonacci number. - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 27 2006
|
|
EXAMPLE
|
The first three terms are 1,1,1. The fourth term is 111 - which is obtained by concatenating the first three terms.
|
|
CROSSREFS
|
Cf. A000213, A002275.
Sequence in context: A152764 A138146 A100706 this_sequence A098034 A109242 A165155
Adjacent sequences: A111861 A111862 A111863 this_sequence A111865 A111866 A111867
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Nov 22 2005
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 27 2006
|
|
|
Search completed in 0.002 seconds
|
