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.

A110596 Balanced numbers n such that n mod 12 = 11.

Original entry on oeis.org

35, 124355, 1739507, 3281663, 3852155, 7649915, 9815195, 10434515, 13321295, 19154135, 19296035, 32807555, 36664595, 41523911, 50329955, 60668135, 69664595, 83338199, 107008811, 123543695, 145960451, 275361359, 321198059, 365269355, 393656879, 407002211
Offset: 1

Views

Author

Walter Kehowski, Sep 13 2005

Keywords

Comments

For the first 26 terms, the quotient (sigma(n)/phi(n)) is 2 or 3.

Crossrefs

Intersection of A017653 and A020492.

Programs

  • Maple
    with(numtheory); BNM11:=[]: for z from 1 to 1 do for n from 1 to 500000 do m:=12*n+11; if sigma(m) mod phi(m) = 0 then BNM11:=[op(BNM11),m] fi; od; od; BNM11;
  • Mathematica
    Select[Range[10^7], Mod[#, 12] == 11 && Divisible[DivisorSigma[1, #], EulerPhi[#]] &] (* Amiram Eldar, Dec 04 2019 *)

Extensions

a(6)-a(26) from Donovan Johnson, Aug 30 2012