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!)
A119360 a(n) = Sum_{i=1..n, j=1..n} i! mod j. 0

%I #3 Aug 24 2012 10:49:57

%S 0,1,3,5,8,3,19,9,18,13,44,9,74,33,18,25,114,27,160,13,33,77,204,9,

%T 113,165,90,61,335,33,497,89,165,233,68,45,707,293,165,33,864,75,875,

%U 165,63,457,1098,57,292,163,318,269,1125,117,143,89,426,567,1561,33,2034,931

%N a(n) = Sum_{i=1..n, j=1..n} i! mod j.

%p P:=proc(n) local i,j,k; for j from 1 by 1 to n do k:=0; for i from 1 by 1 to n do k:=k+(i! mod j); od; print(k); od; end: P(200);

%K easy,nonn

%O 0,3

%A _Paolo P. Lava_ and _Giorgio Balzarotti_, Jul 24 2006

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 July 11 20:23 EDT 2024. Contains 374234 sequences. (Running on oeis4.)