id:A121997 - OEIS Search Results

Search: id:A121997

Displaying 1-1 of 1 results found.

page 1

A121997

Count up to n, n times.

+0
1

1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 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, 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 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`The n-th block consists of n subblocks, each of which counts from 1 to n. This a fractal sequence: removing the first instance of each value leaves the original sequence.`
	EXAMPLE	`1; 1,2;1,2; 1,2,3;1,2,3;1,2,3; ...`
	CROSSREFS	`Cf. A081489 (locations of new values), A075349 (locations of 1's).` `Sequence in context: A105265 A061394 A136314 this_sequence A023128 A023118 A122197` `Adjacent sequences: A121994 A121995 A121996 this_sequence A121998 A121999 A122000`
	KEYWORD	`easy,nonn`
	AUTHOR	`Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Sep 11 2006`

page 1

Search completed in 0.002 seconds

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.

AT&T Labs Research