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!)
A094264 a(n) = Sum_{r = 1..n} (n^r mod r). 3

%I #13 Apr 18 2023 07:38:32

%S 0,0,1,1,4,1,6,10,12,9,20,12,27,32,28,32,57,38,50,67,65,82,75,76,84,

%T 147,101,143,151,117,157,208,205,210,204,199,231,309,274,239,236,275,

%U 257,430,336,364,367,459,322,484,480,551,465,547,556,682,616,733,592,555,493,774

%N a(n) = Sum_{r = 1..n} (n^r mod r).

%H Robert Israel, <a href="/A094264/b094264.txt">Table of n, a(n) for n = 1..10000</a>

%p f:= proc(n) local r; add(n &^ r mod r, r=1..n) end proc:

%p map(f, [$1..100]); # _Robert Israel_, Apr 17 2023

%t Do[Print[Sum[Mod[n^r, r], {r, 1, n}]], {n, 1, 30}] (* _Ryan Propper_, Jul 10 2005 *)

%Y Cf. A094263, A094265.

%K nonn

%O 1,5

%A _Amarnath Murthy_, Apr 26 2004

%E More terms from _Ryan Propper_, Jul 10 2005

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 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)