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

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

Views

Author

Jason Earls, Jun 18 2003

Keywords

Comments

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

References

  • 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.

Crossrefs

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

Programs

  • PARI
    /* 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

Extensions

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

A105331 Numbers of the form 2^n*(2^(n+1)+2n+1) where 2^(n+1)+2n+1 is prime.

Original entry on oeis.org

3, 14, 52, 184, 656, 34688, 2118656, 134438912, 537346048, 9007202811510784, 2417851639318318791262208, 633825300114170432793740312576, 2535301200456572518883997515776
Offset: 1

Views

Author

Farideh Firoozbakht, Apr 28 2005

Keywords

Comments

This sequence is a subsequence of A083874 (see A083874 & A105330).
This is because these numbers satisfy tau(n) + sigma(n) = 2n when n = 2^k * p with p is prime; for instance tau(14) + sigma(14) = 4 + 24 = 28 = 2 x 14. [See References.] - Bernard Schott, Apr 07 2017

Examples

			9007202811510784 is in the sequence because 9007202811510784 = 2^26*(2^27 + 2*26 + 1) and 2^27 + 2*26 + 1 is prime.
		

References

  • J.-M. De Koninck and A. Mercier, 1001 Problèmes en Théorie Classique des Nombres, Ellipses, Problème 723, page 93.

Crossrefs

Programs

  • Mathematica
    Do[If[PrimeQ[2^(m + 1) + 2m + 1], Print[2^m(2^(m + 1) + 2m + 1)]], {m, 0, 110}]
    2^# (2^(#+1)+2#+1)&/@Select[Range[0,100],PrimeQ[2^(#+1)+2#+1]&] (* Harvey P. Dale, Nov 13 2012 *)

Formula

a(n) = 2^A105330(n)*(2^(A105330(n)+1) + 2*A105330(n) + 1). - Bernard Schott, Apr 07 2017

A173168 Primes of the form 2^k + 2k - 1.

Original entry on oeis.org

3, 7, 13, 23, 41, 271, 2069, 16411, 32797, 134217781, 2199023255633, 1125899906842723, 2251799813685349, 2596148429267413814265248164610269, 11150372599265311570767859136324180752990493
Offset: 1

Views

Author

T. D. Noe, Feb 11 2010

Keywords

Comments

Primes in A061761. The values of k-1 are in A105330. These primes, multiplied by 2^(k-1), produce A105331, which are a subset of the dihedral perfect numbers, A083874.

Programs

  • Mathematica
    g[n_]:=2^n+2*n-1; Select[Array[g,100], PrimeQ]

A280846 Numbers k such that all four of the numbers 2^k +- 2k +- 1 are nonprime.

Original entry on oeis.org

9, 10, 16, 17, 19, 20, 21, 22, 23, 24, 26, 29, 30, 33, 34, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 82, 83, 84, 86, 87, 88, 89, 90, 91
Offset: 1

Views

Author

Maverick K. Morrison, Jan 15 2017

Keywords

Examples

			For k=9, 2^k +- 2k +- 1 produces 531, 529, 495, and 493, none of which are prime.
		

Crossrefs

Cf. A061761 (numbers of the form 2^n + 2*n - 1), A105330 (numbers n such that 2^(n+1) + 2n + 1 is prime), A163115 (primes of the form 2^n + 2*n + 1), A173168 (primes of the form 2^k + 2k - 1). - Jon E. Schoenfield, Jan 22 2017

Programs

  • Mathematica
    Select[Range[100],NoneTrue[Flatten[{2^#+2#+{1,-1},2^#-2#+{1,-1}}],PrimeQ]&] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 24 2018 *)
Showing 1-4 of 4 results.