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.

Showing 1-3 of 3 results.

A307161 Numbers n such that A307159(n) = Sum_{k=1..n} bsigma(k) is divisible by n, where bsigma(k) is the sum of bi-unitary divisors of k (A188999).

Original entry on oeis.org

1, 2, 17, 37, 50, 56, 391, 919, 1399, 2829, 6249, 13664, 28829, 62272, 67195, 585391, 5504271, 6798541, 10763933, 866660818, 3830393407, 11044287758, 23058607363, 83159875881, 206501883259, 297734985607, 1087473543732, 1184060078117, 2789730557061, 2821551579466, 3529184155643
Offset: 1

Views

Author

Amiram Eldar, Mar 27 2019

Keywords

Comments

The bi-unitary version of A056550.
The corresponding quotients are 1, 2, 13, 28, 38, 43, ... (see the link for more values).
a(32) > 10^13. - Giovanni Resta, May 28 2019

Crossrefs

Programs

  • Mathematica
    fun[p_,e_] := If[OddQ[e],(p^(e+1)-1)/(p-1),(p^(e+1)-1)/(p-1)-p^(e/2)]; bsigma[1] = 1; bsigma[n_] := Times @@ (fun @@@ FactorInteger[n]); seq={};s = 0; Do[s = s + bsigma[n]; If[Divisible[s,n], AppendTo[seq,n]], {n, 1, 10^6}]; seq

Extensions

a(23)-a(31) from Giovanni Resta, Apr 20 2019

A326488 Numbers m such that A327566(m) = Sum_{k=1..m} isigma(k) is divisible by m, where isigma(k) is the sum of infinitary divisors of k (A049417).

Original entry on oeis.org

1, 2, 160, 285, 2340, 2614, 8903, 81231, 171710, 182712, 434887, 2651907, 56517068, 143714354, 922484770, 5162883263, 39421525873
Offset: 1

Views

Author

Amiram Eldar, Sep 20 2019

Keywords

Comments

The infinitary version of A056550.
The corresponding quotients, A327566(a(n))/a(n), are 1, 2, 118, 209, 1711, 1910, 6506, 59357, 125473, 133513, 317781, 1937798, 41298052, 105014703, 674076450, 3772612983, 28806028088, ...

Examples

			2 is in the sequence since isigma(1) + isigma(2) = 1 + 3 = 4 is divisible by 2.
		

Crossrefs

Cf. A049417 (isigma), A327566 (sums of isigma).
Cf. A056550 (corresponding with sigma), A064611 (unitary), A307043 (exponential), A307161 (bi-unitary).

Programs

  • Mathematica
    f[p_, e_] := p^(2^(-1 + Position[Reverse @ IntegerDigits[e, 2], ?(# == 1 &)])); isigma[1] = 1; isigma[n] := Times @@ (Flatten @ (f @@@ FactorInteger[n]) + 1); seq = {}; s = 0; Do[s = s + isigma [n]; If[Divisible[s, n], AppendTo[seq, n]], {n, 1, 10^6}]; seq

A309272 Numbers m such that m divides A173290(m) = Sum_{k=1..m} psi(k), where psi is the Dedekind psi function (A001615).

Original entry on oeis.org

1, 2, 5, 15, 31, 40, 66, 81, 315, 966, 1398, 1768, 30166, 32335, 98734, 388033, 591597, 1375056, 14966304, 15160528, 50793208, 51302236, 99253376, 110994356, 230465053, 402340268, 497982399, 2027319577, 2879855394, 18450762682, 29922126368, 31711273834, 40583934786
Offset: 1

Views

Author

Amiram Eldar, Oct 23 2019

Keywords

Comments

The corresponding quotients are 1, 2, 4, 12, 24, 31, 51, 62, 240, 735, 1063, 1344, 22924, 24572, 75029, 294870, 449560, 1044918, 11373028, 11520620, 38598210, 38985025, 75423522, 84345597, 175132440, 305741942, 378421246, 1540578144, 2188427680, 14020898356, 22738089456, 24097678498, 30840092321, ...

Examples

			2 is in the sequence since psi(1) + psi(2) = 1 + 3 = 4 is divisible by 2.
5 is in the sequence since psi(1) + psi(2) + ... + psi(5) = 1 + 3 + 4 + 6 + 6 = 20 is divisible by 5.
		

Crossrefs

Programs

  • Mathematica
    psi[1] = 1; psi[n_] := n * Times @@ (1 + 1/Transpose[FactorInteger[n]][[1]]); seq = {}; s = 0; Do[s += psi[n]; If[Divisible[s, n], AppendTo[seq, n]], {n, 1, 10^4}]; seq

Extensions

a(31)-a(33) from Giovanni Resta, Oct 24 2019
Showing 1-3 of 3 results.