Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024931
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024931 a(n) = sum of remainders of n mod 2,4,6,...,2k, where k = [ n/2 ]. +0
1
0, 0, 1, 0, 2, 2, 5, 2, 6, 8, 13, 6, 12, 16, 23, 16, 24, 24, 33, 26, 36, 44, 55, 34, 46, 56, 69, 62, 76, 72, 87, 72, 88, 102, 119, 94, 112, 128, 147, 122, 142, 140, 161, 154, 176, 196, 219, 170, 194, 206, 231, 224, 250, 250, 277, 248, 276, 302, 331, 276, 306, 334, 365, 334, 366, 368 (list; graph; listen)
OFFSET

2,5

CROSSREFS

Sequence in context: A011143 A018216 A059907 this_sequence A029648 A126103 A100030

Adjacent sequences: A024928 A024929 A024930 this_sequence A024932 A024933 A024934

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research