login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156558 a(n)=Sum{k=1..n}{n^k mod (n-k+1)} 3
0, 0, 0, 1, 1, 4, 1, 7, 5, 11, 10, 18, 11, 31, 22, 31, 39, 61, 51, 46, 55, 79, 73, 95, 84, 119, 122, 123, 118, 149, 82, 194, 186, 203, 182, 221, 169, 226, 257, 251, 287, 290, 242, 315, 338, 361, 420, 439, 399, 373, 362, 450, 616, 525, 536, 515, 514, 699, 669, 664, 561 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

MAPLE

P:=proc(i) local a, n; for n from 0 by 1 to i do a:=sum('(n^k mod (n-k+1))', 'k'=1..n); print(a); od; end: P(100);

CROSSREFS

A156556, A156557, A156559

Sequence in context: A019651 A094649 A135857 * A082455 A078975 A050411

Adjacent sequences:  A156555 A156556 A156557 * A156559 A156560 A156561

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Feb 10 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 02:51 EST 2012. Contains 205860 sequences.