id:A033183 - OEIS Search Results

Search: id:A033183

Displaying 1-1 of 1 results found.

page 1

Number of pairs (p,q) such that 4p + 9q = n.

+0
5

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

	OFFSET	`0,37`
	COMMENT	`Contribution from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 07 2009: (Start)` `In other words: number of partitions into 4 or 9;` `a(n) <= A078134(n); a(A078135(n)) = 0;` `a(A167632(n)) = n and a(m) < n for m < A167632(n). (End)`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 0..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 07 2009]`
	FORMULA	`a(n) = [ 7 n/9 ]+1+[ -3 n/4 ]` `G.f.: 1/((1-x^4)*(1-x^9)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 12 2004`
	CROSSREFS	`Sequence in context: A161098 A136177 A066922 this_sequence A090677 A161097 A105240` `Adjacent sequences: A033180 A033181 A033182 this_sequence A033184 A033185 A033186`
	KEYWORD	`nonn,new`
	AUTHOR	`Michel Tixier (tixier(AT)dyadel.net)`

page 1

Search completed in 0.002 seconds

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research