id:A079124 - OEIS Search Results

Search: id:A079124

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).

+0
5

1, 0, 1, 0, 2, 0, 4, 1, 5, 1, 11, 0, 17, 4, 13, 13, 37, 2, 53, 13, 51, 35, 103, 10, 135, 78, 167, 89, 255, 4, 339, 253, 378, 306, 542, 121, 759, 558, 872, 498, 1259, 121, 1609, 1180, 1677, 1665, 2589, 808, 3250, 1969, 3844, 3325, 5119, 1850, 6268, 4758, 7546, 7070 (list; graph; listen)

	OFFSET	`1,5`
	FORMULA	`a(n) = b(0, n), b(m, n) = 1 + sum(b(i, j): m<i<j<phi(n) & i+j=n).`
	CROSSREFS	`Cf. A079126, A000009, A079122, A079125, A067953.` `Sequence in context: A090888 A020781 A007432 this_sequence A056737 A008797 A109468` `Adjacent sequences: A079121 A079122 A079123 this_sequence A079125 A079126 A079127`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 27 2002`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research