id:A067435 - OEIS Search Results

Search: id:A067435

Displaying 1-1 of 1 results found.

page 1

a(n) = sum of all the remainders when n-th odd number is divided by odd numbers < 2n-1.

+0
5

0, 0, 2, 3, 6, 9, 16, 13, 27, 31, 34, 43, 57, 56, 75, 80, 96, 99, 121, 122, 155, 164, 163, 184, 220, 218, 255, 252, 277, 304, 339, 328, 372, 389, 412, 433, 491, 478, 515, 536, 570, 609, 638, 647, 722, 713, 746, 767, 858, 842, 910, 939, 942, 993, 1060, 1057 (list; graph; listen)

	OFFSET	`1,3`
	EXAMPLE	`a(7) = 16 = 1 +3 +6 +4 +2 = 13 % 3 + 13 % 5 + 13 % 7 + 13 % 9 + 13 % 11.`
	CROSSREFS	`Cf. A004125, A067436.` `Adjacent sequences: A067432 A067433 A067434 this_sequence A067436 A067437 A067438` `Sequence in context: A057928 A026735 A006868 this_sequence A035494 A003244 A115995`
	KEYWORD	`easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 29 2002`
	EXTENSIONS	`Corrected and extended by several contributors.`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research