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.

A281782 Numbers n such that sum of prime power divisors of n > sum of prime power divisors of m for all m < n.

This page as a plain text file.
%I A281782 #13 Sep 09 2019 04:24:18
%S A281782 2,3,4,7,8,16,27,32,64,121,125,128,243,256,512,729,1024,2048,4096,
%T A281782 6561,8192,15625,16384,32761,32768,59049,65536,117649,130321,131072,
%U A281782 177147,262144,524287,524288,1048576,1594323,1953125,2097152,4194304,8388608
%N A281782 Numbers n such that sum of prime power divisors of n > sum of prime power divisors of m for all m < n.
%C A281782 Numbers n such that A023889(n) > A023889(m) for all m < n.
%C A281782 Numbers n such that Sum_{p^k|n, p prime, k>=1} p^k > Sum_{p^k|m, p prime, k>=1} p^k for all m < n.
%H A281782 Amiram Eldar, <a href="/A281782/b281782.txt">Table of n, a(n) for n = 1..65</a>
%H A281782 <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%t A281782 mx = 0; t = {}; Do[u = DivisorSum[n, # &, PrimePowerQ[#] &]; If[u > mx, mx = u; AppendTo[t, n]], {n, 8500000}]; t
%Y A281782 Cf. A002093, A002182, A023889, A034090, A174572, A246655, A280013.
%K A281782 nonn
%O A281782 1,1
%A A281782 _Ilya Gutkovskiy_, Apr 14 2017