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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A108581 Positive triangular numbers repeated their own number of times. 0
 1, 3, 3, 3, 6, 6, 6, 6, 6, 6, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS In terms of the repetition convolution operator #, where (sequence A) # (sequence B) = the sequence consisting of A(n) copies of B(n), then this sequence is the repetition self-convolution (A000217(n)-0) # (A000217(n)-0). Over the set of positive infinite integer sequences, # gives a nonassociative noncommutative groupoid with a left identity (A000012) but no right identity, where the left identity is also a right nullifier and idempotent. LINKS FORMULA a(1) = 1, for n>1: a(A000217(n)-1) = a(A000217(n)) = ... = a(A000217(n+1)-2) = A000217(n). CROSSREFS Cf. A000217, A002024, A072649, A074279. Sequence in context: A112669 A098529 A133774 * A073080 A171601 A057944 Adjacent sequences: A108578 A108579 A108580 * A108582 A108583 A108584 KEYWORD easy,nonn AUTHOR Jonathan Vos Post, Jul 25 2005 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 December 9 17:46 EST 2022. Contains 358703 sequences. (Running on oeis4.)