login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 111, 11111, 111111111, 11111111111111111, 1111111111111111111111111111111, 111111111111111111111111111111111111111111111111111111111 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(n) = A002275(A000213(n)), the repunits with the property that their number of digits is a tribonacci number. - Stefan Steinerberger, 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.
MATHEMATICA
nxt[{a_, b_, c_}]:={b, c, FromDigits[Join[Flatten[IntegerDigits/@{a, b, c}]]]}; Transpose[NestList[nxt, {1, 1, 1}, 10]][[1]] (* Harvey P. Dale, Feb 18 2013 *)
CROSSREFS
Sequence in context: A100706 A259102 A262629 * A098034 A109242 A349805
KEYWORD
nonn,easy,base
AUTHOR
Parthasarathy Nambi, Nov 22 2005
EXTENSIONS
More terms from Stefan Steinerberger, Jan 27 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 18:14 EDT 2024. Contains 374726 sequences. (Running on oeis4.)