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!)
A242925 Numbers k such that lambda(k) divides Sum_{j=1..k} lambda(j). 1

%I #10 Jul 04 2018 20:16:12

%S 1,2,3,4,6,7,8,11,12,14,15,16,18,19,20,24,30,31,34,40,42,44,60,72,80,

%T 83,130,132,136,195,208,218,232,254,258,259,260,264,272,276,305,306,

%U 408,420,440,464,504,560,585,586,594,595,609,624,636,715,819,840

%N Numbers k such that lambda(k) divides Sum_{j=1..k} lambda(j).

%C Numbers k such that A162578(k)/A002322(k) = Sum_{j=1..k}A002322(j)/ A002322(k) is an integer where lambda(k) is the Carmichael lambda function (A002322).

%C The corresponding integers are 1, 2, 2, 3, 6, 3, 10, 4, 21, 10, 16, 17, 15, 6, 28, 76, 60, 9, 19, 98, ...

%H G. C. Greubel, <a href="/A242925/b242925.txt">Table of n, a(n) for n = 1..1500</a>

%e 12 is in the sequence because A162578(12)/A002322(12) = 42/2 = 21 is an integer.

%p with(numtheory):nn:=2000:for n from 1 to nn do:p:=lambda(n): s:=sum('lambda(j)', 'j'=1..n):if irem(s,p)=0 then printf(`%d, `,n):else fi:od:

%t nn = 2000; sums = Accumulate[CarmichaelLambda[Range[nn]]]; Select[Range[nn], Mod[sums[[#]],CarmichaelLambda[#]] == 0 &]

%Y Cf. A194855, A002322, A162578.

%K nonn

%O 1,2

%A _Michel Lagneau_, May 26 2014

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 May 1 10:04 EDT 2024. Contains 372163 sequences. (Running on oeis4.)