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-10 of 10 results.

A064605 Numbers k such that A064602(k) is divisible by k.

Original entry on oeis.org

1, 2, 8, 74, 146, 150, 158, 307, 526, 541, 16157, 20289, 271343, 953614, 1002122, 2233204, 3015123, 15988923, 48033767, 85110518238
Offset: 1

Views

Author

Labos Elemer, Sep 24 2001

Keywords

Comments

Analogous sequences for various arithmetical functions are A050226, A056650, A064605, A064606, A064607, A064610, A064611, A048290, A062982, A045345.
a(20) > 3*10^10. - Donovan Johnson, Aug 31 2012
a(21) > 10^11, if it exists. - Amiram Eldar, Jan 18 2024

Examples

			Summing divisor-square sums for j = 1..8 gives 1+5+10+21+26+50+50+85 = 248, which is divisible by 8, so 8 is a term and the integer quotient is 31.
		

Crossrefs

Programs

  • Mathematica
    k = 1; lst = {}; s = 0; While[k < 1000000001, s = s + DivisorSigma[2, k]; If[ Mod[s, k] == 0, AppendTo[lst, k]; Print@ k]; k++]; lst (* Robert G. Wilson v, Apr 25 2011 *)

Formula

(Sum_{j=1..k} sigma_2(j)) mod k = A064602(k) mod k = 0.

Extensions

a(15)-a(19) from Donovan Johnson, Jun 21 2010
a(20) from Amiram Eldar, Jan 18 2024

A064611 Partial sum of usigma is divisible by n, where usigma(n) = A034448(n) and summatory-usigma(n) = A064609(n).

Original entry on oeis.org

1, 2, 8, 11, 12, 174, 212, 524, 1567, 14096, 19795, 38466, 42114, 55575, 338809, 498001, 1175281, 2424880, 3994532, 7908519, 48453784, 696840720, 5497869355, 7479239685
Offset: 1

Views

Author

Labos Elemer, Sep 24 2001

Keywords

Comments

Analogous sequences for various arithmetical functions are A050226, A056550, A064605-A064607, A064610, A064612, A048290, A062982, A045345.

Examples

			udivisor sums[=usigma(j) values] from 1 to 8 are added: 1+3+4+5+6+12+8+9=48; it is divisible by 8, thus 8 is here.
		

Crossrefs

Programs

  • Mathematica
    s = Table[DivisorSum[n, # &, CoprimeQ[#, n/#] &], {n, 10^6}]; Module[{a = First@ s, b = {First@ s}}, Do[a += s[[i]]; If[Divisible[a, i], AppendTo[b, i]], {i, 2, Length@ s}]; b] (* Michael De Vlieger, Mar 18 2017 *)

Formula

A064609(n) mod n = 0.

Extensions

a(17)-a(22) from Donovan Johnson, Jul 20 2012
a(23)-a(24) from Amiram Eldar, Mar 17 2019

A064607 Numbers k such that A064604(k) is divisible by k.

Original entry on oeis.org

1, 2, 7, 151, 257, 1823, 3048, 5588, 6875, 7201, 8973, 24099, 5249801, 9177919, 18926164, 70079434, 78647747, 705686794, 2530414370, 3557744074, 25364328389, 32487653727, 66843959963
Offset: 1

Views

Author

Labos Elemer, Sep 24 2001

Keywords

Comments

Analogous sequences for various arithmetical functions are A050226, A056650, A064605-A064607, A064610, A064611, A048290, A062982, A045345.
a(19) > 2*10^9. - Donovan Johnson, Jun 21 2010
a(24) > 10^11, if it exists. - Amiram Eldar, Jan 18 2024

Examples

			Adding 4th-power divisor-sums for j = 1..7 gives 1+17+82+273+626+1394+2402 = 4795 which is divisible by 7, so 7 is a term and the integer quotient is 655.
		

Crossrefs

Programs

  • Mathematica
    k = 1; lst = {}; s = 0; While[k < 1000000001, s = s + DivisorSigma[4, k]; If[ Mod[s, k] == 0, AppendTo[lst, k]; Print@ k]; k++]; lst (* Robert G.Wilson v, Aug 25 2011 *)

Formula

(Sum_{j=1..k} sigma_4(j)) mod k = A064604(k) mod k = 0.

Extensions

a(13)-a(18) from Donovan Johnson, Jun 21 2010
a(19)-a(23) from Amiram Eldar, Jan 18 2024

A064606 Numbers k such that A064603(k) is divisible by k.

Original entry on oeis.org

1, 2, 7, 45, 184, 210, 267, 732, 1282, 3487, 98374, 137620, 159597, 645174, 3949726, 7867343, 13215333, 14153570, 14262845, 317186286, 337222295, 2788845412, 10937683400, 72836157215, 95250594634
Offset: 1

Views

Author

Labos Elemer, Sep 24 2001

Keywords

Comments

Analogous sequences for various arithmetical functions are A050226, A056650, A064605-A064607, A064610, A064611, A048290, A062982, A045345.
a(22) > 2*10^9. - Donovan Johnson, Jun 21 2010
a(26) > 10^11, if it exists. - Amiram Eldar, Jan 18 2024

Examples

			Adding divisor-cube sums for j = 1..7 gives 1+9+28+73+126+252+344 = 833 = 7*119, which is divisible by 7, so 7 is a term and the integer quotient is 119.
		

Crossrefs

Programs

Formula

(Sum_{j=1..k} sigma_3(j)) mod k = A064603(k) mod k = 0.

Extensions

a(15)-a(21) from Donovan Johnson, Jun 21 2010
a(22)-a(25) from Amiram Eldar, Jan 18 2024

A063971 Values of n for which A013939(n)/n is an integer.

Original entry on oeis.org

1, 6, 7, 8, 9, 455, 457, 458, 459, 461, 8167302, 8167314, 8167315, 8167316, 8167328, 8167330, 8167335, 8167336, 8167346, 8167347, 8167348, 8167350, 8167351, 8167352, 8167410, 8167413
Offset: 1

Views

Author

Labos Elemer, Sep 05 2001

Keywords

Comments

For 455, 457, 458, 459, 461 the quotient is 2. The cause of "step-like" appearance of terms is that the next integer is reached slowly with the summatory function A013939. Next "island" is expected above 500000. Similar phenomenon is observable in the analogous A050226 sequence too.
The quotients for "3rd island" after 8160000 equal 3. (Sep 21 2001)
a(27) > 10^13. - Giovanni Resta, Apr 24 2017

Crossrefs

Programs

  • Mathematica
    s = 0; Do[s = s + Length[FactorInteger[n]]; If[IntegerQ[s/n], Print[n]], {n, 1, 10000000}]

Extensions

More terms from Robert G. Wilson v, Sep 19 2001

A355544 Numbers k such that the arithmetic mean of the first k squarefree numbers is an integer.

Original entry on oeis.org

1, 3, 6, 37, 75, 668, 1075, 37732, 742767, 1811865, 3140083, 8937770, 108268896, 282951249, 633932500, 1275584757, 60455590365
Offset: 1

Views

Author

Amiram Eldar, Jul 06 2022

Keywords

Comments

Numbers k such that A173143(k) is divisible by k.
The corresponding quotients A173143(k)/k are 1, 2, 4, 29, ..., and the corresponding values of A005117(k) are 1, 3, 7, 59, ... (see the link for more values).

Examples

			3 is a term since the arithmetic mean of the first 3 squarefree numbers, (1+2+3)/3 = 2, is an integer.
		

Crossrefs

Programs

  • Mathematica
    s = Select[Range[10^6], SquareFreeQ]; r = Accumulate[s]/Range[Length[s]]; ind = Position[r, _?IntegerQ] // Flatten
  • PARI
    upto(n) = my(s=0,k=0); forsquarefree(m=1, n, s+=m[1]; k+=1; if(s%k == 0, print1(k, ", "))); \\ Daniel Suteu, Jul 06 2022

Extensions

a(17) from Daniel Suteu, Jul 06 2022

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

A339009 Numbers k such that the average number of odd divisors of {1..k} is an integer.

Original entry on oeis.org

1, 2, 165, 170, 1274, 9437, 69720, 69732, 69734, 69736, 515230, 515236, 515246, 28132043, 28132063, 28132079
Offset: 1

Views

Author

Ilya Gutkovskiy, Nov 18 2020

Keywords

Comments

Numbers k that divide A060831(k) where A060831(k) = Sum_{j=1..k} A001227(j).
The sequence also includes: 83860580242, 4578632504347, 4578632504465, 4578632504515. - Daniel Suteu, Nov 24 2020

Examples

			165 is in the sequence because the average number of odd divisors of {1..165} is an integer: A060831(165) / 165 = 495 / 165 = 3.
		

Crossrefs

Programs

  • Mathematica
    s[n_] := Module[{c = 0, k = 1, sum = 0, seq = {}}, While[c < n, sum += DivisorSigma[0, k/2^IntegerExponent[k, 2]]; If[Divisible[sum, k], c++; AppendTo[seq, k]]; k++]; seq]; s[13] (* Amiram Eldar, Nov 18 2020 *)
  • PARI
    f(n) = my(n2=n\2); sum(k=1, sqrtint(n), n\k)*2-sqrtint(n)^2-sum(k=1, sqrtint(n2), n2\k)*2+sqrtint(n2)^2; \\ A060831
    isok(k) = (f(k) % k) == 0; \\ Michel Marcus, Nov 25 2020

A355541 Numbers k such that A061201(k) is divisible by k.

Original entry on oeis.org

1, 2, 7, 31, 1393, 5012, 7649, 50235, 147296, 426606, 611769, 3491681, 9324642, 11815109, 53962364, 82680301, 96789197, 230882246, 378444764, 1489280093, 1489280606, 3651325650, 5891877914, 5891877947, 5891877966, 58604540872
Offset: 1

Views

Author

Amiram Eldar, Jul 06 2022

Keywords

Comments

Numbers k such that the mean value of A007425 over the range 1..k is an integer.
The corresponding quotients are 1, 2, 4, 9, 32, 43, 47, 67, 80, 94, 99, 125, 141, 145, 172, 180, 183, 200, 210, 239, 239, 259, 270, 270, 270, 326, ... .
a(27) > 7.5*10^10, if it exists.

Examples

			7 is a term since A061201(7) = 28 = 4 * 7 is divisible by 7.
		

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := (e+1)*(e+2)/2;  d3[1] = 1; d3[n_] := Times @@ f @@@ FactorInteger[n]; sum = 0; seq = {}; Do[sum += d3[n]; If[Divisible[sum, n], AppendTo[seq, n]], {n, 1, 10^6}]; seq

A355542 Numbers k such that A272718(k) is divisible by k.

Original entry on oeis.org

1, 2, 3, 11, 13, 50, 81, 96, 395, 640, 59136, 65719, 632621, 1342813, 2137073, 2755370, 3446370, 10860093, 321939569, 1872591111, 8858043355
Offset: 1

Views

Author

Amiram Eldar, Jul 06 2022

Keywords

Comments

Numbers k such that the mean value of A018804 over the range 1..k is an integer.
The corresponding quotients are 1, 2, 3, 13, 16, 80, 141, 172, 865, 1500, 219530, 246058, 2804048, 6259092, 10263121, 13445321, 17051542, 57521176, 2036840289, 12849666590, 64967828053, ... .
a(22) > 6.5*10^10, if it exists.

Examples

			11 is a term since A061201(11) = 143 = 11 * 13 is divisible by 11.
		

Crossrefs

Programs

  • Mathematica
    f[p_,e_] := (e*(p-1)/p+1)*p^e; pillai[1] = 1; pillai[n_] := Times @@ f @@@ FactorInteger[n]; seq = {}; sum = 0; Do[sum += pillai[n]; If[Divisible[sum, n], AppendTo[seq, n]], {n, 1, 10^6}]; seq
Showing 1-10 of 10 results.