id:A086146 - OEIS Search Results

Search: id:A086146

Displaying 1-1 of 1 results found.

page 1

a(n) is the smallest k>=n such that the number of partitions of k is a multiple of n, or -1 if no such k exists.

+0
1

1, 2, 3, 11, 7, 9, 10, 11, 14, 19, 12, 21, 28, 19, 24, 66, 54, 21, 20, 58, 24, 25, 32, 70, 44, 28, 39, 55, 91, 97, 44, 66, 35, 94, 39, 80, 86, 47, 129, 66, 45, 75, 100, 58, 129, 75, 56, 70, 68, 74, 178, 62, 66, 340, 58, 75, 209, 97, 93, 124, 115, 101, 138, 66, 84, 75, 111, 94 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`I do not know if a(n) exists for all n. First term which is currently unknown is a(2219) (a(2219) > 11600, while a(2218) = 2602).`
	EXAMPLE	`a(4) is 11 because 11 is the smallest number for which P(11) is divisible by 4, where P() is the partition function.`
	MAPLE	`for i from 2 while i < 30000 do for j from i while j < 1000000000 do c := numbpart(j); if (c mod i = 0) then print(i, j); break; end if; end do; end do;`
	CROSSREFS	`Cf. A046641.` `Sequence in context: A137332 A084047 A127376 this_sequence A082618 A083758 A127494` `Adjacent sequences: A086143 A086144 A086145 this_sequence A086147 A086148 A086149`
	KEYWORD	`nonn`
	AUTHOR	`Jim Nastos (nastos(AT)gmail.com), Aug 25 2003`
	EXTENSIONS	`More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 16 2003`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research