id:A084359 - OEIS Search Results

Search: id:A084359

Displaying 1-1 of 1 results found.

page 1

a(n) = number of partitions of n into pair of parts n=p+q, p>=q>=1, with p-q equal to a square >= 0.

+0
2

0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 5, 6, 5 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`Number of integers k, 1 <= k <= n/2 such that n - 2k is a square.`
	FORMULA	`See Maple line.`
	EXAMPLE	`a(11) = 2: the partitions are (1,10) and (5,6).`
	MAPLE	`A084359 := n->if n mod 2 = 0 then floor(sqrt((n-2)/4))+1 else floor(sqrt((n-2)/4)-1/2)+1; fi; # applies for n >= 2`
	CROSSREFS	`See A083023 for another version.` `Adjacent sequences: A084356 A084357 A084358 this_sequence A084360 A084361 A084362` `Sequence in context: A109969 A085035 A083023 this_sequence A143935 A008616 A097471`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 27 2003`

page 1

Search completed in 0.002 seconds

Last modified November 21 00:02 EST 2008. Contains 150810 sequences.

AT&T Labs Research