id:A067694 - OEIS Search Results

Search: id:A067694

Displaying 1-1 of 1 results found.

page 1

Minimum number of distinct parts in a self-conjugate partition of n, or 0 if n=2.

+0
2

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

	OFFSET	`0,4`
	COMMENT	`There are no self-conjugate partitions of 2, so we set a(2)=0.`
	FORMULA	`a(0)=a(2)=0; a(n^2)=1; a(4n+2)=3 for n>0; a(n)=2 in all other cases.`
	MATHEMATICA	`a[0]=a[2]=0; a[n_] := Which[IntegerQ[Sqrt[n]], 1, Mod[n, 4]==2, 3, True, 2]`
	CROSSREFS	`Cf. A000700, A067731.` `Sequence in context: A141662 A088062 A123884 this_sequence A037195 A131810 A112759` `Adjacent sequences: A067691 A067692 A067693 this_sequence A067695 A067696 A067697`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 05 2002`
	EXTENSIONS	`Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Feb 15 2002`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research