The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325569 Numbers n for which A325565(n) < A325568(n). 3

%I

%S 135,279,525,567,651,1143,1323,2079,2205,2295,2667,2835,3087,4123,

%T 4165,4185,4191,4445,4599,5355,5715,6223,8211,8255,8370,8415,8505,

%U 8925,9207,9359,9765,10731,11475,11811,12397,12495,13335,16575,16863,17010,17325,17577,17885,18423,18767,19467,21483,22995,23715,24583,24941,25039

%N Numbers n for which A325565(n) < A325568(n).

%H Antti Karttunen, <a href="/A325569/b325569.txt">Table of n, a(n) for n = 1..1001</a>

%e 135 has eight divisors: 1, 3, 5, 9, 15, 27, 45, 135. Of these only two, d = 1 and d = 9 are such that A048720(A065621(d),135/d) = 135, thus A325565(135) = 2. On the other hand, when iterating A325567 starting from 135 we get: A325567(135) = 9, A325567(9) = 3 and A325567(3) = 1, so A325568(135) = 3 > A325565(135), thus 135 is included in this sequence.

%o (PARI) isA325569(n) = (A325565(n)<A325568(n));

%Y Cf. A325565, A325567, A325568.

%K nonn

%O 1,1

%A _Antti Karttunen_, May 09 2019

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

Last modified September 22 17:39 EDT 2021. Contains 347607 sequences. (Running on oeis4.)