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.

A276699 Numbers n such that Sum_{q|n} 0.q is an integer where q ranges over the aliquot parts of n.

This page as a plain text file.
%I A276699 #8 Sep 20 2016 13:18:10
%S A276699 14,297,869,1241,1349,1541,1769,1829,1961,2021,82091,88931,98171,
%T A276699 100739,105779,111899,116651,122411,125771,130139,135419,139499,
%U A276699 150971,152771,157979,158819,165251,169739,173939,174611,177851,182051,183731,188339,189731,193091
%N A276699 Numbers n such that Sum_{q|n} 0.q is an integer where q ranges over the aliquot parts of n.
%C A276699 Mainly numbers ending in 1 or 9.
%C A276699 So far Sum{q | n} 0.q is generally equal to 1 apart from 297 with 3 and 235569 with 6.
%H A276699 Paolo P. Lava, <a href="/A276699/b276699.txt">Table of n, a(n) for n = 1..48</a>
%e A276699 Aliquot parts of 14 are 1, 2, 7 and 0.1 + 0.2 + 0.7 = 1;
%e A276699 Aliquot parts of 297 are 1, 3, 9, 11, 27, 33, 99 and 0.1 + 0.3 + 0.9 + 0.11 + 0.27 + 0.33 + 0.99 = 3;
%p A276699 with(numtheory): P:= proc(q) local a,n;
%p A276699 for n from 2 to q do a:=sort([op(divisors(n))]);
%p A276699 if type(add(a[k]/10^(ilog10(a[k])+1),k=1..nops(a)-1),integer)
%p A276699 then print(n); fi; od; end: P(10^9);
%Y A276699 Cf. A276465, A276655, A276700.
%K A276699 nonn,base
%O A276699 1,1
%A A276699 _Paolo P. Lava_, Sep 15 2016