id:A101422 - OEIS Search Results

Search: id:A101422

Displaying 1-1 of 1 results found.

page 1

Minimal number of primes needed to sum to Fibonacci(n).

+0
3

1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 3, 2, 3, 1, 2, 3, 2, 2, 3, 1, 2, 3, 3, 2, 3, 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 1, 3, 2, 3, 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 2, 3, 2, 3, 3, 2, 2, 3 (list; graph; listen)

	OFFSET	`3,4`
	FORMULA	`a(n) = A051034(A000045(n)).`
	EXAMPLE	`a(5)=1 because Fibonacci(5)=5 is a prime.` `a(6)=2 because Fibonacci(6)=8 = 3+5.` `a(7)=1 because Fibonacci(7)=13 is a prime.` `a(14)=3 because Fibonacci(14)=377 = 2+2+373.`
	CROSSREFS	`Cf. A000045, A051034, A001605, A102106, A102107.` `Adjacent sequences: A101419 A101420 A101421 this_sequence A101423 A101424 A101425` `Sequence in context: A105220 A083654 A029428 this_sequence A070304 A083952 A043529`
	KEYWORD	`nonn`
	AUTHOR	`Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jan 17 2005`
	EXTENSIONS	`Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 18 2005`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research