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 21 results. Next

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

Cf. A001157, A064602, A050226, A056650, A064606, A064607, A064610, A064611, A064612, A048290, A062982, A045345.

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

A064610 Places k where A064608(k) (partial sums of unitary tau) is divisible by k.

Original entry on oeis.org

1, 35, 37, 1015, 27417, 27421, 27449, 27453, 19774739, 530743781, 530743799, 530743807, 530743813
Offset: 1

Views

Author

Labos Elemer, Sep 24 2001

Keywords

Comments

The corresponding quotients are 1, 3, 3, 5, 7, 7, 7, 7, 11, 13, 13, 13, 13, ...
a(14) > 7.5*10^10, if it exists. - Amiram Eldar, Jun 04 2021

Examples

			For n = 37, the sum A064608(37) = 1+2+2+2+2+4+2+...+4+4+4+2 = 111 = 3*37, so 37 is in the sequence.

Crossrefs

Cf. A064608.
Analogous "integer-mean" sequences for various arithmetical functions are A050226, A056650, A064605, A064606, A064607, A048290, A063986, A063971, A064911, A062982, A045345.

Programs

  • Mathematica
    s[1] = 1; s[n_] := s[n] = s[n - 1] + 2^PrimeNu[n]; Select[Range[30000], Divisible[s[#], #] &] (* Amiram Eldar, Jun 04 2021 *)

Formula

{n: A064608(n) == 0 (mod n)}.

Extensions

a(10)-a(13) from Donovan Johnson, Jul 20 2012

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.

Links

Crossrefs

Cf. A034448, A064609, A050226, A056550, A064605, A064606, A064607, A064610, A064612, A048290, A062982, A045345.

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

Cf. A001159, A064604, A050226, A056650, A064605, A064606, A064610-A064612, A048290, A062982, A045345.

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

A063985 Partial sums of cototient sequence A051953.

Original entry on oeis.org

0, 1, 2, 4, 5, 9, 10, 14, 17, 23, 24, 32, 33, 41, 48, 56, 57, 69, 70, 82, 91, 103, 104, 120, 125, 139, 148, 164, 165, 187, 188, 204, 217, 235, 246, 270, 271, 291, 306, 330, 331, 361, 362, 386, 407, 431, 432, 464, 471, 501, 520, 548, 549, 585, 600, 632, 653, 683
Offset: 1

Views

Author

Labos Elemer, Sep 06 2001

Keywords

Comments

Number of elements in the set {(x,y): 1 <= x <= y <= n, 1 = gcd(x,y)}; a(n) = A000217(n) - A002088(n) = A100613(n) - A185670(n). - Reinhard Zumkeller, Jan 21 2013
8*a(n) is the number of dots not in direct reach via a straight line from the center of a 2*n+1 X 2*n+1 array of dots. - Kiran Ananthpur Bacche, May 25 2022

Links

Crossrefs

Cf. A000010, A000217, A002088, A048290, A051953.

Programs

  • Haskell
    a063985 n = length [()| x <- [1..n], y <- [x..n], gcd x y > 1]
-- Reinhard Zumkeller, Jan 21 2013
  • Java
    // Save the file as A063985.java to compile and run
import java.util.stream.IntStream;
import java.util.*;
public class A063985 {
  public static int getInvisiblePoints(int n) {
    Set slopes = new HashSet();
    IntStream.rangeClosed(1, n).forEach(i ->
      {IntStream.rangeClosed(1, n).forEach(j ->
        slopes.add(Float.valueOf((float)i/(float)j))); });
    return (n * n - slopes.size() + n - 1) / 2;
  }
  public static void main(String args[]) throws Exception {
    IntStream.rangeClosed(1, 30).forEach(i ->
      System.out.println(getInvisiblePoints(i)));
  }
} // Kiran Ananthpur Bacche, May 25 2022
  • Mathematica
    f[n_] := n(n + 1)/2 - Sum[ EulerPhi@i, {i, n}]; Array[f, 58] (* Robert G. Wilson v *)
Accumulate[Table[n-EulerPhi[n],{n,1,60}]] (* Harvey P. Dale, Aug 19 2015 *)
  • PARI
    { a=0; for (n=1, 1000, write("b063985.txt", n, " ", a+=n - eulerphi(n)) ) } \\ Harry J. Smith, Sep 04 2009
  • Python
    from sympy.ntheory import totient
def a(n): return sum(x - totient(x) for x in range(1,n + 1))
[a(n) for n in range(1, 51)] # Indranil Ghosh, Mar 18 2017
  • Python
    from functools import lru_cache
@lru_cache(maxsize=None)
def A063985(n): # based on second formula in A018805
    if n == 0:
        return 0
    c, j = 0, 2
    k1 = n//j
    while k1 > 1:
        j2 = n//k1 + 1
        c += (j2-j)*(k1*(k1+1)-2*A063985(k1)-1)
        j, k1 = j2, n//j2
    return (2*n+c-j)//2 # Chai Wah Wu, Mar 24 2021

Formula

a(n) = Sum_{x=1..n} (x - phi(x)) = Sum(x) - Sum(phi(x)) = A000217(n) - A002088(n), phi(n) = A000010(n), cototient(n) = A051953(n).
a(n) = n^2 - A091369(n). - Enrique Pérez Herrero, Feb 25 2012
G.f.: x/(1 - x)^3 - (1/(1 - x))*Sum_{k>=1} mu(k)*x^k/(1 - x^k)^2. - Ilya Gutkovskiy, Mar 18 2017
a(n) = (1/2 - 3/Pi^2)*n^2 + O(n*log(n)). - Amiram Eldar, Jul 26 2022

Extensions

Corrected by Robert G. Wilson v, Dec 13 2006

A064612 Partial sum of bigomega is divisible by n, where bigomega(n)=A001222(n) and summatory-bigomega(n)=A022559(n).

Original entry on oeis.org

1, 4, 5, 2178, 416417176, 416417184, 416417185, 416417186, 416417194, 416417204, 416417206, 416417208, 416417213, 416417214, 416417231, 416417271, 416417318, 416417319, 416417326, 416417335, 416417336, 416417338, 416417339, 416417374
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.
Partial sums of A001222, similarly to summatory A001221 increases like loglog(n), explaining small quotients.
a(25) > 10^13. - Giovanni Resta, Apr 25 2017

Examples

			Sum of bigomega values from 1 to 5 is: 0+0+1+1+2+1=5, which is divisible by n=5, so 5 is here, with quotient=1. For the last value,2178,below 1000000 the quotient is only 3.

Crossrefs

A001222, A022559, A050226, A056650, A064602-A064611, A048290, A062982, A045345.

Formula

Mod[A022559(n), n]=0

Extensions

a(5)-a(24) from Donovan Johnson, Nov 15 2009

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

Cf. A001158, A064603, A050226, A056650, A064605, A064607, A064610-A064612, A048290, A062982, A045345.

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

A063986 Numbers k that divide Sum_{j=1..k} A051953(j) where A051953(j) = j - Phi(j). Arithmetic mean of first k cototient values is an integer.

Original entry on oeis.org

1, 4, 5, 24, 25, 249, 600, 617, 12272, 13763, 21332, 25228, 783665, 15748051, 41846733, 195853251, 2488541984, 14399065016, 21119309213, 22430204140, 43787603128, 157825075944, 206651865067, 271605149320, 374049315076, 650288309748
Offset: 1

Views

Author

Labos Elemer, Sep 06 2001

Keywords

Comments

The odd terms of A048290 and A063986 are the same. - Jud McCranie, Jun 26 2005
a(27) > 10^12. - Donovan Johnson, Dec 09 2011

Examples

			k=5: (1 + 1 + 2 + 2 + 4)/5 = 2.

Crossrefs

Cf. A051953, A000010, A002088, A048920, A000217, A050226.

Programs

  • Mathematica
    s = 0; Do[s = s + n - EulerPhi[n]; If[ IntegerQ[s/n], Print[n]], {n, 1, 10^7} ]

Extensions

More terms from Dean Hickerson, Sep 07 2001
One more term from Robert G. Wilson v, Sep 07 2001
a(16) and a(17) from Jud McCranie, Jun 22 2005
a(18)-a(21) from Donovan Johnson, May 11 2010
a(22)-a(26) from Donovan Johnson, Dec 09 2011

A306950 Numbers m that divide A177754(m) = Sum_{k=1..m} uphi(k), where uphi is the unitary totient function (A047994).

Original entry on oeis.org

1, 2, 32, 36, 39, 50, 62, 147, 169, 190, 203, 467, 1035, 1075, 2174, 2475, 27047, 28097, 91087, 181175, 215795, 539654, 580160, 668988, 868879, 2611450, 14359486, 118119399, 1030191204, 1109928219, 2362155122
Offset: 1

Views

Author

Amiram Eldar, Mar 17 2019

Keywords

Comments

The unitary version of A048290.

Examples

			32 is in the sequence since A177754(32) = 384 = 32 * 12 is divisible by 32.

Links

Crossrefs

Cf. A047994, A048290, A064611, A177754.

Programs

  • Mathematica
    uphi[1] = 1; uphi[n_] := Product[{p, e} = pe; p^e-1, {pe, FactorInteger[n]}]; seq={}; s = 0; Do[s = s + uphi[n]; If[Divisible[s,n], AppendTo[seq, n]], {n, 1, 10^6}]; seq (* after Jean-François Alcover at A047994 *)

A379922 Numbers m that divide the alternating sum Sum_{k=1..m} (-1)^(k+1) * sigma_2(k).

Original entry on oeis.org

1, 2, 3, 42, 329, 633, 1039, 5689, 26621, 39245, 1101875, 1216075, 40088584, 67244920, 104332211, 549673265, 777631064, 19879301756
Offset: 1

Views

Author

Amiram Eldar, Jan 06 2025

Keywords

Comments

Numbers m such that m | A379921(m).
The corresponding quotients, A379921(m)/m, are -1, 2, -2, 120, 5228, ... (see the link for more values).
a(19) > 5*10^10, if it exists.

Links

Crossrefs

Cf. A001157 (sigma_2), A379921.
Similar sequences: A050226, A048290, A056550, A064605, A067929, A067931, A379923, A379924.

Programs

  • Mathematica
    With[{m = 40000}, Position[Accumulate[Table[(-1)^n * DivisorSigma[2, n], {n, 1, m}]]/Range[m], _?IntegerQ] // Flatten]
  • PARI
    list(lim) = my(s = 0); for(k = 1, lim, s += (-1)^k * sigma(k, 2); if(!(s % k), print1(k, ", ")));
Showing 1-10 of 21 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.