id:A088858 - OEIS Search Results

Search: id:A088858

Displaying 1-1 of 1 results found.

page 1

Define a Fibonacci-type sequence to be one of the form s(0) = s_1 >= 1, s(1) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.

+0
2

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

	OFFSET	`1,2`
	REFERENCES	`T. Denes, Problem 413, Discrete Math. 272 (2003), 302.`
	CROSSREFS	`See A088527 (which is a(n)+1), the main entry for this sequence.` `Sequence in context: A085887 A049108 A086925 this_sequence A113312 A053475 A140605` `Adjacent sequences: A088855 A088856 A088857 this_sequence A088859 A088860 A088861`
	KEYWORD	`nonn,easy`
	AUTHOR	`Don Reble (djr(AT)nk.ca), Nov 20 2003`

page 1

Search completed in 0.002 seconds

Last modified December 10 00:48 EST 2009. Contains 170565 sequences.

AT&T Labs Research