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.

A110599 Balanced numbers n such that n mod 12 = 7.

This page as a plain text file.
%I A110599 #11 Dec 04 2019 11:40:56
%S A110599 24871,58435,140335,1529983,2086903,3722875,3830827,8697535,13932919,
%T A110599 16408315,21578755,27882595,76319155,126245119,183531439,192871987,
%U A110599 198394675,207619555,229523371,337800463,361504507,416690995,440127655,535044055,693298315,729802255
%N A110599 Balanced numbers n such that n mod 12 = 7.
%C A110599 For the first 26 terms, the quotient (sigma(n)/phi(n)) is 2 or 3.
%H A110599 Amiram Eldar, <a href="/A110599/b110599.txt">Table of n, a(n) for n = 1..7901</a> (terms below 6.5*10^14, calculated using data from Jud McCranie)
%p A110599 with(numtheory); BNM7:=[]: for z from 1 to 1 do for m from 1 to 1000000 do n:=12*m+7; if sigma(n) mod phi(n) = 0 then BNM7:=[op(BNM7),n] fi; od; od; BNM7;
%t A110599 Select[Range[10^7], Mod[#, 12] == 7 && Divisible[DivisorSigma[1, #], EulerPhi[#]] &] (* _Amiram Eldar_, Dec 04 2019 *)
%Y A110599 Intersection of A017605 and A020492.
%Y A110599 Cf. A000010, A000203, A062699.
%K A110599 nonn
%O A110599 1,1
%A A110599 _Walter Kehowski_, Sep 13 2005
%E A110599 Duplicate terms removed and a(8)-a(26) from _Donovan Johnson_, Aug 30 2012