id:A030067 - OEIS Search Results

Search: id:A030067

Displaying 1-1 of 1 results found.

page 1

Semi-Fibonacci numbers: a(1) = 1; a(n) = a(n/2) (n even); a(n) = a(n-1)+a(n-2) (n odd).

+0
10

1, 1, 2, 1, 3, 2, 5, 1, 6, 3, 9, 2, 11, 5, 16, 1, 17, 6, 23, 3, 26, 9, 35, 2, 37, 11, 48, 5, 53, 16, 69, 1, 70, 17, 87, 6, 93, 23, 116, 3, 119, 26, 145, 9, 154, 35, 189, 2, 191, 37, 228, 11, 239, 48, 287, 5, 292, 53, 345, 16, 361, 69, 430, 1, 431, 70, 501, 17, 518, 87, 605, 6, 611, 93 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`a(2n+1) >= a(2n-1)+1 is monotonically increasing. a(2n)/n can be arbitrarily small, as a(2^n) = 1. There are probably an infinite number of primes in a(n). - Jonathan Vos Post (jvospost2(AT)yahoo.com), Mar 28 2006`
	LINKS	`T. D. Noe, Table of n, a(n) for n = 1..10000`
	CROSSREFS	`Cf. A000045, A074364.` `Sequence in context: A120250 A116529 A064989 this_sequence A105800 A105602 A111079` `Adjacent sequences: A030064 A030065 A030066 this_sequence A030068 A030069 A030070`
	KEYWORD	`nonn,nice`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research