login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156556 a(n) = Sum_{k=1..n} (n^k mod (n+k)). 3
0, 1, 2, 10, 9, 23, 26, 43, 40, 67, 73, 80, 69, 124, 155, 156, 186, 232, 186, 247, 258, 312, 388, 345, 310, 568, 377, 541, 580, 585, 530, 673, 615, 911, 777, 1048, 830, 948, 702, 1271, 1024, 1286, 1403, 1320, 1159, 1458, 1388, 1545, 1590, 1632, 1714, 1906, 1883 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
MAPLE
P:=proc(i) local a, n; for n from 0 by 1 to i do a:=sum('(n^k mod (n+k))', 'k'=1..n); print(a); od; end: P(100);
PROG
(PARI) a(n) = sum(k=1, n, n^k%(n+k)); \\ Jinyuan Wang, Aug 02 2021
CROSSREFS
Sequence in context: A081100 A215463 A066556 * A071808 A355486 A168381
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 10:56 EDT 2024. Contains 371791 sequences. (Running on oeis4.)