Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A018238
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A018238 Add 1 to leading digit and put in front. +0
3
1, 21, 3121, 41213121, 5121312141213121, 61213121412131215121312141213121, 7121312141213121512131214121312161213121412131215121312141213121 (list; graph; listen)
OFFSET

1,2

COMMENT

The concatenation of first n terms (if n is small) yields a palindrome: 1, 121, 1213121, etc. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 08 2003

Comments from M. F. Hasler (www.univ-ag.fr/~mhasler), May 05 2008 (Start): This is not the case from n=10 on: According to the formula in A123121 A082215(10) has an even number of digits, the middle digits being "10". (In a strict sense, e.g. Def. 3 of the first reference there, A082215(9) is the last Zimin word on the alphabet {1,...,9}, though.)

While there is less ambiguity about the definition of A018238(10), it is not clear if A018238(11) should start with "11..." or with "10..." (the largest digit of all subsequent terms being "9"). According to the formula in A123121, a(100) has 3 digits more than a(99), so the first choice seems appropriate and has been adopted for the given PARI code.

However, it corresponds to a modified definition, "a(n) = concatenation of n and all preceding terms". a(3) is the only prime term up to a(14) included. The sequence is (1,0,1,0,1,0,...) (mod 3), at least up to a(20). (End)

LINKS

M. F. Hasler, Table of n, a(n) for n=1,...,11.

PROGRAM

(PARI) A018238(n, t="")=for(k=2, n, t=Str(t, k-1, t)); eval(Str(n, t)) - M. F. Hasler (www.univ-ag.fr/~mhasler), May 05 2008

CROSSREFS

Cf. A001511.

Cf. A082215, A123121.

Sequence in context: A114934 A098375 A095154 this_sequence A098724 A078395 A153833

Adjacent sequences: A018235 A018236 A018237 this_sequence A018239 A018240 A018241

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Michael Minic (minic(AT)mtsu.edu)

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 17 15:31 EDT 2010. Contains 173524 sequences.


AT&T Labs Research