id:A131234 - OEIS Search Results

Search: id:A131234

Displaying 1-1 of 1 results found.

page 1

Starts with 1, then n appears Fibonacci(n-1) times.

+0
2

1, 2, 3, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The largest non-decreasing sequence a(n) such that a(Fibonacci(n-1)) = n.`
	MATHEMATICA	`Flatten[{1, Table[Table[n, {Fibonacci[n - 1]}], {n, 10}]}]`
	CROSSREFS	`Cf. A072649 n occurs A000045(n) times.` `Sequence in context: A030601 A049839 A130233 this_sequence A056791 A027434 A071940` `Adjacent sequences: A131231 A131232 A131233 this_sequence A131235 A131236 A131237`
	KEYWORD	`nonn`
	AUTHOR	`Tanya Khovanova (tanyakh(AT)yahoo.com), Jun 20 2007`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research