id:A065745 - OEIS Search Results

Search: id:A065745

Displaying 1-1 of 1 results found.

page 1

Sum of squares and twice squares dividing n.

+0
1

1, 3, 1, 7, 1, 3, 1, 15, 10, 3, 1, 7, 1, 3, 1, 31, 1, 30, 1, 7, 1, 3, 1, 15, 26, 3, 10, 7, 1, 3, 1, 63, 1, 3, 1, 70, 1, 3, 1, 15, 1, 3, 1, 7, 10, 3, 1, 31, 50, 78, 1, 7, 1, 30, 1, 15, 1, 3, 1, 7, 1, 3, 10, 127, 1, 3, 1, 7, 1, 3, 1, 150, 1, 3, 26, 7, 1, 3, 1, 31, 91, 3, 1, 7, 1, 3, 1, 15, 1, 30, 1 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Matthew M. Conroy, Home page (listed instead of email address)`
	FORMULA	`Multiplicative with a(2^e)=2^(e+1)-1, a(p^e)=(p^(e+2)-1)/(p-1)/(p+1) for odd p and even e and a(p^e)=(p^(e+1)-1)/(p-1)/(p+1) for odd p and odd e.`
	CROSSREFS	`Cf. A065704, A035316.` `Sequence in context: A112132 A053381 A038712 this_sequence A117677 A038870 A140435` `Adjacent sequences: A065742 A065743 A065744 this_sequence A065746 A065747 A065748`
	KEYWORD	`mult,nonn`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 04 2001`
	EXTENSIONS	`More terms from Matthew M. Conroy, Jan 19 2002`

page 1

Search completed in 0.003 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research