id:A117484 - OEIS Search Results

Search: id:A117484

Displaying 1-1 of 1 results found.

page 1

Number of triangular numbers mod n.

+0
3

1, 2, 2, 4, 3, 4, 4, 8, 4, 6, 6, 8, 7, 8, 6, 16, 9, 8, 10, 12, 8, 12, 12, 16, 11, 14, 11, 16, 15, 12, 16, 32, 12, 18, 12, 16, 19, 20, 14, 24, 21, 16, 22, 24, 12, 24, 24, 32, 22, 22, 18, 28, 27, 22, 18, 32, 20, 30, 30, 24, 31, 32, 16, 64, 21, 24, 34, 36, 24, 24, 36, 32, 37, 38, 22 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Same as A000224 (number of squares mod n) for n odd, since there we can divide by 2 and then complete the square.`
	FORMULA	`Multiplicative with a(2^e) = 2^e, a(p^e) = floor(p^(e+1)/(2p+2))+1 for p>2.`
	CROSSREFS	`Cf. A000224.` `Sequence in context: A087808 A094950 A087874 this_sequence A086835 A046701 A140472` `Adjacent sequences: A117481 A117482 A117483 this_sequence A117485 A117486 A117487`
	KEYWORD	`mult,easy,nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 25 2006`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research