A007503 -id:A007503 - cp's OEIS frontend

A322256 Numbers k such that t(k) = t(k+1) where t(k) = tau(k) + sigma(k) = A007503(k) is the number of subgroups of the dihedral group of order 2k.

14, 1334, 1634, 2685, 33998, 42818, 64665, 84134, 109214, 122073, 166934, 289454, 383594, 440013, 544334, 605985, 649154, 655005, 792855, 845126, 1642154, 2284814, 2305557, 2913105, 3571905, 3682622, 4701537, 5181045, 6431732, 6444873, 6771405, 10074477

Offset: 1

Amiram Eldar, Dec 01 2018

nonn

Jensen and Keane asked if this sequence is infinite. Jensen and Bussian suggested the calculation of this sequence as a part of a student research project.

Supersequence of A054004. Terms that are not in it are 845126, 14392646, 10461888478, ...

Amiram Eldar, Table of n, a(n) for n = 1..400
David W. Jensen and Michael K. Keane, A Number-Theoretic Approach to Subgroups of Dihedral Groups, USAFA-TR-90-2, Air Force Academy Colorado Springs, Colorado, 1990.
David W. Jensen and Eric R. Bussian, A Number-Theoretic Approach to Counting Subgroups of Dihedral Groups, The College Mathematics Journal, Vol. 23, No. 2 (1992), pp. 150-152.

Cf. A007503, A054004, A083874.

[n: n in [1..2*10^6] | (NumberOfDivisors(n) + SumOfDivisors(n)) eq (NumberOfDivisors(n+1) + SumOfDivisors(n+1))]; // Vincenzo Librandi, Dec 08 2018

t[n_] := DivisorSigma[0, n] + DivisorSigma[1, n]; tQ[n_] := t[n] == t[n + 1]; Select[Range[1000000], tQ]

isok(n) = (numdiv(n)+sigma(n)) == (numdiv(n+1)+sigma(n+1)); \\ Michel Marcus, Dec 04 2018

A064840 a(n) = tau(n)*sigma(n).

Original entry on oeis.org

1, 6, 8, 21, 12, 48, 16, 60, 39, 72, 24, 168, 28, 96, 96, 155, 36, 234, 40, 252, 128, 144, 48, 480, 93, 168, 160, 336, 60, 576, 64, 378, 192, 216, 192, 819, 76, 240, 224, 720, 84, 768, 88, 504, 468, 288, 96, 1240, 171, 558, 288, 588, 108, 960, 288, 960, 320, 360

Offset: 1

Vladeta Jovovic, Oct 25 2001

Dirichlet convolution of A034761 with (the Dirichlet inverse of A037213). - R. J. Mathar, Feb 11 2011

			For n = 10, a(10) = sigma(10) * tau(10) = 18 * 4 = 72. - _Indranil Ghosh_, Jan 20 2017

Indranil Ghosh, Table of n, a(n) for n = 1..10000 (first 1000 terms from Harry J. Smith)
Vaclav Kotesovec, Graph - the asymptotic ratio

Cf. A000005, A000203, A007503, A062354, A062355.

[ NumberOfDivisors(n)*SumOfDivisors(n) : n in [1..40]];

with(numtheory): seq(sigma(n)*tau(n), n=1..58) ; # Zerinvary Lajos, Jun 04 2008

Table[ DivisorSigma[0, n] * DivisorSigma[1, n], {n, 1, 58}] (* Jean-François Alcover, Mar 26 2013 *)

{ for (n=1, 1000, a=numdiv(n)*sigma(n); write("b064840.txt", n, " ", a) ) } \\ Harry J. Smith, Sep 28 2009

Multiplicative with a(p^e) = (p^(e+1)-1)*(e+1)/(p-1). a(n) = (1/2)*Sum_{i|n, j|n} (i+j).
Dirichlet g.f. (zeta(s)*zeta(s-1))^2/zeta(2s-1). - R. J. Mathar, Feb 11 2011
Sum_{k=1..n} a(k) ~ Pi^4 * n^2 / (144*Zeta(3)) * (2*log(n) - 1 + 4*gamma - 4*Zeta'(3)/Zeta(3) + 24*Zeta'(2)/Pi^2), where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, Jan 31 2019

A062249 a(n) = n + d(n), where d(n) = number of divisors of n, cf. A000005.

Original entry on oeis.org

2, 4, 5, 7, 7, 10, 9, 12, 12, 14, 13, 18, 15, 18, 19, 21, 19, 24, 21, 26, 25, 26, 25, 32, 28, 30, 31, 34, 31, 38, 33, 38, 37, 38, 39, 45, 39, 42, 43, 48, 43, 50, 45, 50, 51, 50, 49, 58, 52, 56, 55, 58, 55, 62, 59, 64, 61, 62, 61, 72, 63, 66, 69, 71, 69, 74, 69, 74, 73, 78, 73

Offset: 1

Ahmed Fares (ahmedfares(AT)my-deja.com), Jul 01 2001

nonn

Number of cyclic subgroups of dihedral group with 2n elements.

a(n) is the n-th smallest number not a divisor of n. - J. Lowell, Apr 06 2008

Harry J. Smith, Table of n, a(n) for n=1..1000

Cf. A007503, A060710, A000005, A049820.

Cf. A064491 (iteration, start=1).

a062249 n = a000005 n + n  -- Reinhard Zumkeller, Mar 29 2014

with(numtheory):seq(n+tau(n), n=1..71) ; # Zerinvary Lajos, Jun 04 2008

Table[n + DivisorSigma[0, n], {n, 100}] (* Indranil Ghosh, Apr 12 2017 *)

a(n) = n + numdiv(n) \\ Harry J. Smith, Aug 03 2009

from sympy.ntheory import divisor_count
[n + divisor_count(n) for n in range(101)] # Indranil Ghosh, Apr 12 2017

a(n) = n + A000005(n). - Omar E. Pol, Dec 12 2008
From Ilya Gutkovskiy, Apr 12 2017: (Start)
G.f.: x/(1 - x)^2 + Sum_{k>=1} x^k/(1 - x^k).
Dirichlet g.f.: zeta(s)^2 + zeta(s-1). (End)

Formula and more terms from Vladeta Jovovic, Jul 03 2001

A069734 Number of pairs (p,q), 0<=p<=q, such that p+q divides n.

Original entry on oeis.org

1, 3, 3, 6, 4, 9, 5, 11, 8, 12, 7, 19, 8, 15, 14, 20, 10, 24, 11, 26, 18, 21, 13, 37, 17, 24, 22, 33, 16, 42, 17, 37, 26, 30, 26, 53, 20, 33, 30, 52, 22, 54, 23, 47, 42, 39, 25, 71, 30, 51, 38, 54, 28, 66, 38, 67, 42, 48, 31, 94, 32, 51, 55, 70, 44, 78, 35, 68, 50, 78, 37, 108

Offset: 1

Valery A. Liskovets, Apr 07 2002

Also number of orientable coverings of the Klein bottle with 2n lists (orientable m-list coverings exist only for even m).
Equals row sums of triangle A178650. - Gary W. Adamson, May 31 2010
Also number of inequivalent sublattices of index n of the rectangular lattice, that has the p2mm (pmm) symmetry group [Rutherford]. For other 2D Patterson groups, the analogous sequences are A000203 (p2), A145391 (c2mm), A145392 (p4), A145393 (p4mm), A145394 (p6), A003051 (p6mm). - Andrey Zabolotskiy, Mar 12 2018

			There are 9 pairs (p,q), 0<=p<=q, such that p+q divides 6: (0,1), (0,2), (0,3), (0,6), (1,1), (1, 2), (1, 5), (2, 4), (3, 3); thus a(6) = 9.
x + 3*x^2 + 3*x^3 + 6*x^4 + 4*x^5 + 9*x^6 + 5*x^7 + 11*x^8 + 8*x^9 + ...

Andrey Zabolotskiy, Table of n, a(n) for n = 1..10000
V. A. Liskovets and A. Mednykh, Number of non-orientable coverings of the Klein bottle
John S. Rutherford, Sublattice enumeration. IV. Equivalence classes of plane sublattices by parent Patterson symmetry and colour lattice group type, Acta Cryst. (2009). A65, 156-163. [See Table 2]. [From _N. J. A. Sloane_, Feb 23 2009]
Index entries for sequences related to sublattices

Cf. A069733, A069735, A046524, A178650.
Cf. A000203, A145391-A145394, A003051.
Cf. A304182, A304183, A008619, A007503, A183063.

with(numtheory): a := n -> (sigma(n) + tau(n) + `if`(irem(n,2) = 1, 0, tau(n/2)))/2: seq(a(n), n=1..72); # Peter Luschny, Jul 20 2019

a[n_] := (DivisorSigma[1, n] + DivisorSigma[0, n] + If[OddQ[n], 0, DivisorSigma[0, n/2]])/2;
Array[a, 72] (* Jean-François Alcover, Aug 27 2019, from Maple *)

{a(n) = if( n<1, 0, sum( k=1, n, sum( j=0, k, n%(j+k) == 0)))} /* Michael Somos, Mar 24 2012 */

a(n) = A046524(2n) - A069733(2n).
Inverse Moebius transform of: 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, ... G.f.: Sum_{n>0} x^n*(1+x^n-x^(2*n))/(1-x^(2*n))/(1-x^n). - Vladeta Jovovic, Feb 03 2003
a(n) = (A000203(n) + A069735(n))/2. [Rutherford] - N. J. A. Sloane, Mar 13 2009
a(n) = Sum_{ m: m^2|n } A304182(n/m^2) + A304183(n/m^2) = A069735(n) + Sum_{ m: m^2|n } A304183(n/m^2). - Andrey Zabolotskiy, May 07 2018
a(n) = Sum_{ d|n } A008619(d) = Sum_{ d|n } (1 + floor(d/2)). - Andrey Zabolotskiy, Jul 20 2019
a(n) = (A007503(n) + A183063(n))/2. - Peter Luschny, Jul 20 2019

New description from Vladeta Jovovic, Feb 03 2003

A286360 Compound filter (prime signature & sum of the divisors): a(n) = P(A046523(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function.

Original entry on oeis.org

1, 8, 12, 49, 23, 142, 38, 239, 124, 259, 80, 753, 107, 412, 412, 1051, 173, 1237, 212, 1390, 672, 826, 302, 3427, 565, 1087, 1089, 2223, 467, 5080, 530, 4403, 1384, 1717, 1384, 7911, 743, 2086, 1836, 6352, 905, 7780, 992, 4477, 3928, 2932, 1178, 14583, 1774, 5368, 2932, 5898, 1487, 10177, 2932, 10177, 3576, 4471, 1832, 25711, 1955, 5056, 6567, 18019, 3922

Offset: 1

Antti Karttunen, May 10 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Pairing Function
Index entries for sequences related to sigma(n)

Cf. A000027, A286359, A286460.

Cf. A007503, A065608 (sequences matching to this filter), also A000203, A046523, A161942, A286034, A286357.

A000203(n) = sigma(n);
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from Charles R Greathouse IV, Aug 17 2011
A286360(n) = (1/2)*(2 + ((A046523(n)+A000203(n))^2) - A046523(n) - 3*A000203(n));
for(n=1, 10000, write("b286360.txt", n, " ", A286360(n)));

from sympy import factorint, divisor_sigma as D
def T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
def P(n):
    f = factorint(n)
    return sorted([f[i] for i in f])
def a046523(n):
    x=1
    while True:
        if P(n) == P(x): return x
        else: x+=1
def a(n): return T(a046523(n), D(n)) # Indranil Ghosh, May 12 2017

(define (A286360 n) (* (/ 1 2) (+ (expt (+ (A046523 n) (A000203 n)) 2) (- (A046523 n)) (- (* 3 (A000203 n))) 2)))

a(n) = (1/2)*(2 + ((A046523(n)+A000203(n))^2) - A046523(n) - 3*A000203(n)).

A336840 Inverse Möbius transform of A048673.

Original entry on oeis.org

1, 3, 4, 8, 5, 14, 7, 22, 17, 18, 8, 42, 10, 26, 26, 63, 11, 65, 13, 55, 38, 30, 16, 124, 30, 38, 80, 81, 17, 100, 20, 185, 44, 42, 50, 206, 22, 50, 56, 164, 23, 148, 25, 94, 127, 62, 28, 368, 68, 117, 62, 120, 31, 316, 58, 244, 74, 66, 32, 318, 35, 78, 189, 550, 74, 172, 37, 133, 92, 196, 38, 626, 41, 86, 174, 159

Offset: 1

Antti Karttunen, Aug 07 2020

nonn

Arithmetic mean of the number of divisors (A000005) and prime-shifted sigma (A003973), thus a(n) is the average between the number of and the sum of divisors of A003961(n).

The local minima occur on primes p, where p/2 < a(p) <= (p+1).

Antti Karttunen, Table of n, a(n) for n = 1..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
Index entries for sequences computed from indices in prime factorization
Index entries for sequences related to sigma(n)

Cf. A000005, A003961, A003973, A007503, A048673, A113415, A336838, A336839, A336841, A349371, A349384, A349385, A349910 [= a(n)-A048673(n)], A364063, A378520 (Dirichlet inverse).

A048673(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (factorback(f)+1)/2; };
A336840(n) = sumdiv(n,d,A048673(d));

A336840(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); (1/2)*(numdiv(n)+sigma(factorback(f))); };

a(n) = Sum_{d|n} A048673(d).
a(n) = (1/2) * (A000005(n) + A003973(n)).
a(n) = A113415(A003961(n)). - Antti Karttunen, Jun 01 2022
a(n) = A349371(A003961(n)) = A364063(A048673(n)). - Antti Karttunen, Nov 30 2024

A064205 Numbers k such that sigma(k) + tau(k) is a prime.

Original entry on oeis.org

1, 2, 8, 128, 162, 512, 32768, 41472, 101250, 125000, 1414562, 3748322, 5120000, 6837602, 8000000, 13530402, 24234722, 35701250, 66724352, 75031250, 78125000, 86093442, 91125000, 171532242, 177058562, 226759808, 233971712, 617831552, 664301250, 686128968

Offset: 1

Jason Earls, Sep 21 2001

nonn

The terms involve powers of small primes. - Jud McCranie, Nov 29 2001
From Kevin P. Thompson, Jun 20 2022: (Start)
Theorem: Terms that are greater than one must be twice a square.
Proof: Since sigma(k) is odd if and only if k is a square or twice a square, and tau(k) is odd if and only if k is a square, then an odd sum only occurs when k is twice a square, in which case sigma(k) is odd and tau(k) is even. So, these are the only candidates for sigma(k) + tau(k) being prime.
Theorem: No terms are congruent to 4 or 6 (mod 10).
Proof: Since no square ends in 2, 3, 7, or 8, and each term > 1 is twice a square, no term ends in 4 or 6. (End)

			128 is a term since sigma(128) + tau(128) = 255 + 8 = 263, which is prime.

Amiram Eldar, Table of n, a(n) for n = 1..5000 (first 34 terms from Harry J. Smith, terms 35..276 from Kevin P. Thompson)

Cf. A007503 (sigma+tau), A065061, A055813.

Do[ If[ PrimeQ[ DivisorSigma[1, n] + DivisorSigma[0, n]], Print[n]], {n, 1, 10^7}]

{ n=0; for (m=1, 10^9, if (isprime(sigma(m) + numdiv(m)), write("b064205.txt", n++, " ", m); if (n==100, break)) ) } \\ Harry J. Smith, Sep 10 2009

from itertools import count, islice
from sympy import isprime, divisor_sigma as s, divisor_count as t
def agen(): # generator of terms
    yield 1
    yield from (k for k in (2*i*i for i in count(1)) if isprime(s(k)+t(k)))
print(list(islice(agen(), 30))) # Michael S. Branicky, Jun 20 2022

More terms from Robert G. Wilson v, Nov 12 2001
More terms from Labos Elemer, Nov 22 2001
More terms from Jud McCranie, Nov 29 2001
a(28) from Harry J. Smith, Sep 10 2009

A083874 Numbers k such that sigma(k) + tau(k) = 2k.

Original entry on oeis.org

1, 3, 14, 52, 130, 184, 656, 8648, 12008, 34688, 2118656, 33721216, 40575616, 59376256, 89397016, 99523456, 134438912, 150441856, 173706136, 283417216, 537346048, 1082640256, 6801628304, 91707741184, 14451706793984, 102898828936832, 141573123151232

Offset: 1

Jason Earls, Jun 18 2003

nonn

Dihedral perfect numbers: degree n such that dihedral group D_{2n} has order equal to its total number of subgroups, i.e. A007503(n)=2n. - Lekraj Beedassy, Oct 14 2004
If 2^(m+1)+2m+1 is prime then 2^m*(2^(m+1)+2m+1) is in the sequence (see A105330 & A105331). This fact is a result of the following interesting theorem that I found (take k=0). Theorem: If m & k are integers and 2^(m+1)+2m+1-k is prime then 2^m*(2^(m+1)+2m+1-k) is a solution of the equation sigma(x)+ tau(x)=2x+k; the proof is easy. - Farideh Firoozbakht, Apr 27 2005
Allowing n = 2^k pq, for primes p < q, it is fairly easy to discover that p must be in the range 2^(k+1) to 2^(k+2) and there is only one possible q for each p. Exhaustive search can be used to find the primes p. The sequence up to a(23) has all possible solutions for k=1, 3 and 7. There is one solution for k=10: 91707741184; one solution for k=12: 14451706793984; and three solutions for k=15: 2258918614925312, 1153167823398797312, 4611826823562493952. There are no other n = 2^k pq for k up to 26. - T. D. Noe, Jun 19 2008
Assuming n has the form 2^k pqr, for primes p < q < r, there are only a finite number of triples (p,q,r) possible for each k. For k=3, the sequence already has 89397016 and 173706136. For k=4, 6801628304 is the only solution. For k=7, the search finds 102898828936832, 141573123151232, 220346295412352, 619057492909952, and 3585817801980032. For k=9, 989473186649763328 is the only solution. There are no other solutions for k <= 13. - T. D. Noe, Feb 12 2010

J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 130, p. 44, Ellipses, Paris 2008.
J.-M. De Koninck & A. Mercier, 1001 Problèmes en Théorie Classique Des Nombres, Problem 723 pp. 93;308 Ellipses Paris 2004.
J.-M. De Koninck & A. Mercier, 1001 Problems in Classical Number Theory, AMS, 2007.

Max Alekseyev, Table of n, a(n) for n = 1..40 (first 35 terms from Hiroaki Yamanouchi)
David W. Jensen and Eric R. Bussian, A Number-Theoretic Approach to Counting Subgroups of Dihedral Groups, Two-Year College Math. Jnl., 23 (1992), 150-152.

Cf. A007503, A105330, A105331.

Cf. A173168 (primes of the form 2^k+2k-1).

/* running start from entry 20+*/ forstep(k= 1082640256, 2000000000000,2,if((numdiv(k)+sigma(k))==2*k,write("A083874.txt",k))) \\ Bill McEachen, Jun 14 2006

a(11)-a(20) from David Wasserman, Dec 03 2004
a(21) from Farideh Firoozbakht, Apr 27 2005
a(22) from Vladeta Jovovic confirmed and a(23) added by Bill McEachen, Jun 14 2006
a(24) from T. D. Noe confirmed by Donovan Johnson, Dec 29 2008
a(25)-a(27) from Hiroaki Yamanouchi, Aug 28 2018
Edited by Max Alekseyev, Jul 30 2025

A116963 Inverse Moebius transform of the shifted tetrahedral numbers.

Original entry on oeis.org

4, 14, 24, 49, 60, 118, 124, 214, 244, 356, 368, 608, 564, 814, 896, 1183, 1144, 1668, 1544, 2162, 2168, 2678, 2604, 3698, 3336, 4228, 4304, 5344, 4964, 6732, 5988, 7728, 7528, 8924, 8616, 11297, 9884, 12214, 12064, 14668, 13248, 17132, 15184, 18928, 18412, 21038

Offset: 1

Jonathan Vos Post, Mar 31 2006

			a(12) = ((1+1)*(1+2)*(1+3)/6) + ((2+1)*(2+2)*(2+3)/6) + ((3+1)*(3+2)*(3+3)/6) + ((4+1)*(4+2)*(4+3)/6) + ((6+1)*(6+2)*(6+3)/6) + ((12+1)*(12+2)*(12+3)/6) = 4 + 10 + 20 + 35 + 84 + 455 = 608.
a(13) = ((1+1)*(1+2)*(1+3)/6) + ((13+1)*(13+2)*(13+3)/6) = 4 + 560 = 564.

Seiichi Manyama, Table of n, a(n) for n = 1..10000

See also: A007437 (inverse Moebius transform of triangular numbers).
Cf. A000292, A007437, A007503.
Cf. A013662, A059358, A363604, A363607, A363611.
Cf. A000005, A000203, A001157, A001158.

a[n_] := DivisorSum[n, Binomial[# + 3, 3] &]; Array[a, 50] (* Amiram Eldar, Jul 05 2023 *)

my(N=50, x='x+O('x^N)); Vec(sum(k=1, N, 1/(1-x^k)^4-1)) \\ Seiichi Manyama, Jun 12 2023

a(n) = Sum_{d|n} (d+1)*(d+2)*(d+3)/6 = Sum_{d|n} A000292(d+1).
G.f.: Sum_{k>0} (1/(1-x^k)^4 - 1). - Seiichi Manyama, Jun 12 2023
From Amiram Eldar, Dec 30 2024: (Start)
a(n) = (sigma_3(n) + 6*sigma_2(n) + 11*sigma_1(n) + 6*sigma_0(n))/6.
Dirichlet g.f.: zeta(s) * (zeta(s-3) + 6*zeta(s-2) + 11*zeta(s-1) + 6*zeta(s)) / 6.
Sum_{k=1..n} a(k) ~ (zeta(4)/24) * n^4. (End)

A055813 Primes arising in A064205.

Original entry on oeis.org

2, 5, 19, 263, 373, 1033, 65551, 123833, 283553, 292993, 2197633, 5778673, 12795193, 10500613, 19980283, 32213033, 36978853, 72494813, 140724953, 164119063, 183105509, 193710277, 320210941, 450065801, 268354393, 496922891, 506906473, 1333406021

Offset: 1

Labos Elemer, Nov 22 2001

nonn

			a(3) = 19 since, for A064205(3) = 8, sigma(8)+tau(8) = 15+4 = 19, a prime number. - _Michael De Vlieger_, Dec 17 2016

Amiram Eldar, Table of n, a(n) for n = 1..5000 (terms 1..276 from Michel Marcus)

Cf. A007503, A064205.

Select[Table[Total@ Map[DivisorSigma[#, n] &, {0, 1}], {n, 10^7}], PrimeQ] (* Michael De Vlieger, Dec 17 2016 *)

lista(nn) = for (n=1, nn, if (isprime(p=sigma(n) + numdiv(n)), print1(p, ", "))); \\ Michel Marcus, Dec 18 2016

a(n) = A007503(A064205(n)). - Amiram Eldar, Dec 06 2022

cp's OEIS Frontend

A322256 Numbers k such that t(k) = t(k+1) where t(k) = tau(k) + sigma(k) = A007503(k) is the number of subgroups of the dihedral group of order 2k.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

A064840 a(n) = tau(n)*sigma(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A062249 a(n) = n + d(n), where d(n) = number of divisors of n, cf. A000005.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Formula

Extensions

A069734 Number of pairs (p,q), 0<=p<=q, such that p+q divides n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A286360 Compound filter (prime signature & sum of the divisors): a(n) = P(A046523(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Python

Scheme

Formula

A336840 Inverse Möbius transform of A048673.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

Formula

A064205 Numbers k such that sigma(k) + tau(k) is a prime.

Views

Author