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.

A380927 Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -5.

This page as a plain text file.
%I A380927 #3 Mar 03 2025 11:14:32
%S A380927 49,1029,9317,11858,15092,19208,21609,195657,199927,221221,244783,
%T A380927 249018,281554,311542,316932,319319,396508,403368,406406,453789,
%U A380927 517244,1771561,2254714,2869636,3652264,4108797,4198467,4645641,4648336,5140443,5229378,5812079,5912634
%N A380927 Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = -5.
%e A380927 517244 = 2^2*7^3*13*29 = 517244*2/(2-5) +517244*3/(7-5) + 517244/(13-5) + 517244/(29-5)
%p A380927 with(numtheory): P:=proc(q, h) local k, n, v; v:=[];
%p A380927 for n from 1 to q do if n mod 5>0 then if n=add(n*k[2]/(k[1]+h), k=ifactors(n)[2]) then v:=[op(v), n];
%p A380927 fi; fi; od; op(v); end: P(6949250, -5);
%Y A380927 Cf. A380888, A380889, A380900, A380901, A380923-A380926, A380928.
%K A380927 nonn,easy
%O A380927 1,1
%A A380927 _Paolo P. Lava_, Mar 03 2025