id:A087917 - OEIS Search Results

Search: id:A087917

Displaying 1-1 of 1 results found.

page 1

Number of unordered ways to write n as a sum of 3 odious numbers (A000069).

+0
2

0, 0, 1, 1, 1, 2, 1, 1, 2, 3, 2, 3, 3, 2, 4, 6, 5, 5, 6, 5, 6, 8, 8, 9, 9, 8, 10, 12, 12, 14, 14, 10, 14, 19, 14, 18, 20, 14, 19, 25, 21, 20, 27, 22, 23, 32, 26, 27, 31, 29, 31, 36, 35, 35, 39, 34, 38, 47, 40, 42, 47, 40, 43, 60, 53, 44, 60, 50, 48, 68, 62, 54, 64, 65, 58, 75 (list; graph; listen)

	OFFSET	`1,6`
	FORMULA	`a(n) = sum(i+j+k=n, A010060(i)A010060(j)A010060(k)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 19 2004`
	PROGRAM	`(PARI) a(n)=sum(i=1, n, sum(j=1, i, sum(k=1, j, if(i+j+k-n, 0, A010060(i)A010060(j)A010060(k)))))`
	CROSSREFS	`Cf. A087916.` `Cf. A010060.` `Sequence in context: A091093 A049615 A114919 this_sequence A087741 A054991 A047071` `Adjacent sequences: A087914 A087915 A087916 this_sequence A087918 A087919 A087920`
	KEYWORD	`nonn,easy`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 18 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research