id:A060030 - OEIS Search Results

Search: id:A060030

Displaying 1-1 of 1 results found.

page 1

If the numbers a(1)...a(n) contain a hole, then a(n+1) is the largest hole; otherwise a(n+1) = a(n-1) + a(n).

+0
3

1, 2, 3, 5, 4, 9, 8, 7, 6, 13, 12, 11, 10, 21, 20, 19, 18, 17, 16, 15, 14, 29, 28, 27, 26, 25, 24, 23, 22, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83 (list; graph; listen)

	OFFSET	`0,2`
	CROSSREFS	`See A060482 for successive records, A027383 for the final hole-filling values, A016116 for the difference between top and bottom of downward subsequences, A052551 for number of terms in downward subsequences.` `Cf. A060000, A000045.` `Sequence in context: A119475 A096116 A085875 this_sequence A081025 A124653 A085947` `Adjacent sequences: A060027 A060028 A060029 this_sequence A060031 A060032 A060033`
	KEYWORD	`easy,nice,nonn`
	AUTHOR	`William Nelles (wnelles(AT)flashmail.com), Mar 17 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research