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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A128117 At the n-th iteration the sequence of integers from 1 to n are appended to the sequence a(n) times. 3
 1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10258 (first 371 terms from Reed Kelly) EXAMPLE a(5) = 2 so 1,2,3,4,5,1,2,3,4,5 is added to the end of the sequence at the fifth iteration. MATHEMATICA cr[n_] := Module[ { A = {1, 1, 2}, i, j }, For [ i = 3, i <= n, i++, A = Join[ A, Flatten[ Table[ Range[i], {A[[i]]} ]]]; ]; A ] PROG (PARI) a = vector(101, n, 1); m=0; for (n=1, 10, for (t=1, a[n], for (k=1, n, print1 (a[m++]=k", ")))) \\ Rémy Sigrist, Feb 09 2022 CROSSREFS Cf. A001462. Sequence in context: A199086 A098053 A272907 * A373212 A023115 A194436 Adjacent sequences: A128114 A128115 A128116 * A128118 A128119 A128120 KEYWORD easy,nonn AUTHOR Reed Kelly, Feb 15 2007 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.

Last modified September 7 22:13 EDT 2024. Contains 375749 sequences. (Running on oeis4.)