cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A367632 Numbers k with at least one pair of adjacent divisors i,j of k with i < j such that i' > j'. Here, n' denotes the arithmetic derivative of n.

This page as a plain text file.
%I A367632 #16 Nov 26 2023 10:52:39
%S A367632 20,28,40,42,44,52,56,60,66,68,72,76,78,80,84,88,92,99,100,102,104,
%T A367632 110,112,114,116,117,120,124,126,130,132,136,138,140,144,148,152,153,
%U A367632 156,160,164,168,170,171,172,174,176,180,184,186,188,190,196,198,200,204
%N A367632 Numbers k with at least one pair of adjacent divisors i,j of k with i < j such that i' > j'. Here, n' denotes the arithmetic derivative of n.
%C A367632 Numbers whose list of arithmetic derivatives of its divisors has at least one descent (in terms of its increasing list of divisors).
%C A367632 First departs from A137428 at a(11) = 72.
%e A367632 72 is in the sequence. The divisors of 72 are {1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72} and their corresponding derivatives are {0, 1, 1, 4, 5, 12, 6, 16, 21, 44, 60, 156}. Since 8 < 9, and 8' = 12 > 6 = 9', 72 is a member.
%t A367632 ad[1] = 0; ad[n_] := n * Plus @@ ((Last[#]/First[#]) & /@ FactorInteger[n]); q[n_] := Module[{d = Divisors[n]}, AnyTrue[Range[Length[d] - 1], ad[d[[#]]] > ad[d[[# + 1]]] &]]; Select[Range[200], q] (* _Amiram Eldar_, Nov 25 2023 *)
%Y A367632 Cf. A003415 (n'), A137428.
%K A367632 nonn
%O A367632 1,1
%A A367632 _Wesley Ivan Hurt_, Nov 24 2023