id:A098833 - OEIS Search Results

Search: id:A098833

Displaying 1-1 of 1 results found.

page 1

Numbers n such that the sum of primes dividing n (with repetition) is a Fibonacci number.

+0
1

1, 2, 3, 5, 6, 13, 15, 16, 18, 22, 38, 56, 63, 68, 75, 80, 89, 90, 93, 96, 106, 108, 145, 174, 195, 208, 231, 233, 234, 253, 275, 289, 330, 343, 352, 396, 490, 494, 588, 644, 664, 695, 700, 705, 747, 752, 834, 836, 840, 846, 884, 896, 916, 920, 945, 959, 1000, 1008 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Conjecture: there are infinitely many consecutive terms in this sequence. For example, sopfr(143335) = 377 and sopfr(143336) = 89 are both Fibonacci numbers.`
	EXAMPLE	`a(10)=22 because the sum of its prime factors is 13, the 7th` `Fibonacci number.`
	CROSSREFS	`Cf. A001414.` `Sequence in context: A064725 A100330 A020473 this_sequence A075371 A057704 A078203` `Adjacent sequences: A098830 A098831 A098832 this_sequence A098834 A098835 A098836`
	KEYWORD	`nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Oct 10 2004`

page 1

Search completed in 0.002 seconds

Last modified December 9 14:43 EST 2009. Contains 170430 sequences.

AT&T Labs Research