A163491 - OEIS

This site is supported by donations to The OEIS Foundation.

A163491

A fractal sequence (if we delete the first occurence of n we get the sequence itself).

1, 1, 1, 2, 1, 2, 3, 1, 2, 4, 3, 1, 5, 2, 4, 6, 3, 1, 7, 5, 2, 8, 4, 6, 9, 3, 1, 10, 7, 5, 11, 2, 8, 12, 4, 6, 13, 9, 3, 14, 1, 10, 15, 7, 5, 16, 11, 2, 17, 8, 12, 18, 4, 6, 19, 13, 9, 20, 3, 14, 21, 1, 10, 22, 15, 7, 23, 5, 16, 24, 2, 6, 11, 15, 20, 24 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	COMMENTS	`Write the natural integers this way: 1...2...3...4...5...6...7....and fill undefined places with the sequence itself. A003602 is obtained by starting from 1..2..3..4..5..6....`
	FORMULA	`a(3n-2)=n`
	EXAMPLE	`1...2...3...4....-->1.1..2...3...4....-->1.1.1.2...3...4....-->1.1.1.2...3...4....-->1.1.1.2.1..3...4....-->1.1.1.2.1.2.3...4....-->1.1.1.2.1.2.3.1..4....-->1.1.1.2.1.2.3.1.2.4....`
	CROSSREFS	`Cf. A003602` `Sequence in context: A194917 A194914 A195076 * A080772 A145111 A104795` `Adjacent sequences: A163488 A163489 A163490 * A163492 A163493 A163494`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 29 2009`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.