id:A049997 - OEIS Search Results

Search: id:A049997

Displaying 1-1 of 1 results found.

page 1

a(n) = n-th number of the form F(i)*F(j), when these Fibonacci-products are arranged in order without duplicates.

+0
6

0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 13, 15, 16, 21, 24, 25, 26, 34, 39, 40, 42, 55, 63, 64, 65, 68, 89, 102, 104, 105, 110, 144, 165, 168, 169, 170, 178, 233, 267, 272, 273, 275, 288, 377, 432, 440, 441, 442, 445, 466, 610, 699, 712, 714, 715, 720, 754 (list; graph; listen)

	OFFSET	`0,3`
	MATHEMATICA	`Take[ Union@Flatten@Table[ Fibonacci[i]Fibonacci[j], {i, 0, 16}, {j, 0, i}], 61] (from Robert G. Wilson v (rgwv(at)rgwv.com), Dec 14 2005)`
	CROSSREFS	`See A049998 for further information about this sequence. Cf. A080097.` `Sequence in context: A110495 A052347 A022773 this_sequence A039170 A097624 A000398` `Adjacent sequences: A049994 A049995 A049996 this_sequence A049998 A049999 A050000`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research