A000978 -id:A000978 - cp's OEIS frontend

A127963 Number of 1's in A127962(n).

2, 3, 4, 6, 7, 9, 10, 12, 16, 22, 31, 40, 51, 64, 84, 96, 100, 157, 174, 351, 855, 1309, 1770, 2904, 5251, 5346, 5640, 6196, 7240, 21369, 41670, 47685, 58620, 63516, 69469, 70540, 133509, 134994, 187161, 493096, 2015700

Offset: 1

Artur Jasinski, Feb 09 2007

Cf. A000120, A000978, A000979, A007953, A124400, A126614, A127936, A127955, A127956, A127957, A127958, A127961, A127962.

b = {}; Do[c = 1 + Sum[2^(2n - 1), {n, 1, x}]; If[PrimeQ[c], AppendTo[b, c]], {x, 0, 1000}]; a = {}; Do[AppendTo[a, FromDigits[IntegerDigits[b[[x]], 2]]], {x, 1, Length[b]}]; d = {}; Do[AppendTo[d, DigitCount[a[[x]], 10, 1]], {x, 1, Length[a]}]; d (* Artur Jasinski, Feb 09 2007 *)
DigitCount[#, 2, 1]& /@ Select[Table[(2^p + 1)/3, {p, Prime[Range[300]]}], PrimeQ] (* Amiram Eldar, Jul 23 2023 *)

a(n) = A000120(A000979(n)). - Michel Marcus, Nov 07 2013

a(n) = A007953(A127962(n)). - Amiram Eldar, Jul 23 2023

a(22)-a(29) from Vincenzo Librandi, Mar 31 2012

a(30)-a(41) from Amiram Eldar, Jul 23 2023

A127964 Number of 0's in the binary expansion of A127962(n).

Original entry on oeis.org

0, 1, 2, 4, 5, 7, 8, 10, 14, 20, 29, 38, 49, 62, 82, 94, 98, 155, 172, 349, 853, 1307, 1768, 2902, 5249, 5344, 5638, 6194, 7238, 21367, 41668, 47683, 58618, 63514, 69467, 70538, 133507, 134992, 187159, 493094, 2015698

Offset: 1

Artur Jasinski, Feb 09 2007

Apparently numbers k such that (2^(2*k+3)+1)/3 is prime. - James R. Buddenhagen, Apr 14 2011 [This is true. See the second formula. - Amiram Eldar, Oct 13 2024]

Cf. A000978, A000979, A023416, A127962, A127961, A000979, A000978, A124400, A126614, A127955, A127956, A127957, A127958, A127936.

b = {}; Do[c = 1 + Sum[2^(2n - 1), {n, 1, x}]; If[PrimeQ[c], AppendTo[b, c]], {x, 0, 1000}]; a = {}; Do[AppendTo[a, FromDigits[IntegerDigits[b[[x]], 2]]], {x, 1, Length[b]}]; d = {}; Do[AppendTo[d, DigitCount[a[[x]], 10, 0]], {x, 1, Length[a]}]; d
(Select[Prime[Range[200]], PrimeQ[(2^# + 1)/3] &] - 3)/2 (* Amiram Eldar, Oct 13 2024 *)

a(n) = A023416(A000979(n)). - Michel Marcus, Nov 07 2013

a(n) = (A000978(n)-3)/2. - Amiram Eldar, Oct 13 2024

a(22)-a(29) from Vincenzo Librandi, Mar 31 2012

a(30)-a(41) from Amiram Eldar, Oct 13 2024

A127965 Number of bits in A127962(n).

Original entry on oeis.org

2, 4, 6, 10, 12, 16, 18, 22, 30, 42, 60, 78, 100, 126, 166, 190, 198, 312, 346, 700, 1708, 2616, 3538, 5806, 10500, 10690, 11278, 12390, 14478, 42736, 83338, 95368, 117238, 127030, 138936, 141078, 267016, 269986, 374320, 986190, 4031398

Offset: 1

Artur Jasinski, Feb 09 2007

Cf. A127962, A127963, A127964, A127961, A000979, A000978, A124400, A126614, A127955, A127956, A127957, A127958, A127936.

b = {}; Do[c = 1 + Sum[2^(2n - 1), {n, 1, x}]; If[PrimeQ[c], AppendTo[b, c]], {x, 0, 1000}]; a = {}; Do[AppendTo[a, FromDigits[IntegerDigits[b[[x]], 2]]], {x, 1, Length[b]}]; d = {}; Do[AppendTo[d, DigitCount[a[[x]], 10, 0]+DigitCount[a[[x]], 10, 1]], {x, 1, Length[a]}]; d

a(n) = A127964(n) + A127963(n).

a(n) = 1 + floor(log_2(A000979(n))) = 1 + floor(log_2(2^A000978(n)+1) - A020857) = A000978(n) - 1. - R. J. Mathar, Feb 01 2008

a(22)-a(29) from Vincenzo Librandi, Mar 30 2012

a(30)-a(41) from Amiram Eldar, Oct 19 2024

A194810 Indices k such that A139250(k) = A000979(n).

Original entry on oeis.org

2, 4, 8, 32, 64, 256, 512, 2048, 32768, 2097152, 1073741824, 549755813888, 1125899906842624, 9223372036854775808, 9671406556917033397649408, 39614081257132168796771975168, 633825300114114700748351602688

Offset: 1

Omar E. Pol, Oct 23 2011

nonn

Indices k such that the number of toothpicks in the toothpick structure of A139250 after k-th stage equals the n-th Wagstaff prime A000979. All terms of this sequence are powers of 2 (see formulas).

For a picture of the n-th Wagstaff prime as a toothpick structure see the Applegate link "A139250: the movie version", then enter N = a(n) and click "Update", for N = a(n) <= 32768 (due to the resolution of the movie).

			For n = 5 we have that a(5) = 64, then we can see that the number of toothpicks in the toothpick structure of A139250 after 64 stages is 2731 which coincides with the fifth Wagstaff prime, so we can write A139250(64) = A000979(5) = 2731. See the illustration in the Applegate-Pol-Sloane paper, figure 3: T(64) = 2731 toothpicks.

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, arXiv:1004.3036 [math.CO], 2010.
David Applegate, The movie version
C. Caldwell's The Top Twenty, Wagstaff.
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Wikipedia, Wagstaff prime

Cf. A000978, A000979, A007583, A001045, A127936, A127958, A127962, A127965, A139250, A139253.

2^Reap[Do[If[PrimeQ[1+Sum[2^(2n-1), {n, m}]], Sow[m]], {m, 100}]][[2, 1]] (* Jean-François Alcover, Oct 06 2018 *)

a(n) = 2^A127936(n) = 2^(floor(A000978(n)/2)) = 2^(ceiling(log_4(A000979(n)))).
A139250(2^n) = A007583(n), n >= 0.
A139250(a(n)) = A000979(n).

More terms from Omar E. Pol, Mar 14 2012

A235683 Numbers n such that (46^n + 1)/47 is prime.

Original entry on oeis.org

7, 23, 59, 71, 107, 223, 331, 2207, 6841, 94841

Offset: 1

Robert Price, Jan 13 2014

All terms up to a(10) are primes.

a(11) > 10^5.

J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A000978 = numbers n such that (2^n + 1)/3 is prime. Cf. A007658, A057171, A057172, A057173, A057175, A001562, A057177, A057178, A057179, A057180, A057181, A057182, A057183, A057184, A057185, A057186, A057187, A057188, A057189, A057190, A057191, A071380, A071381, A071382, A084741, A084742, A065507, A126659, A126856, A185240, A229145, A229524, A230036, A229663, A231604, A231865.

Do[ p=Prime[n]; If[ PrimeQ[ (46^p + 1)/47 ], Print[p] ], {n, 1, 9592} ]

is(n)=ispseudoprime((46^n+1)/47) \\ Charles R Greathouse IV, May 22 2017

A237052 Numbers n such that (49^n + 1)/50 is prime.

Original entry on oeis.org

7, 19, 37, 83, 1481, 12527, 20149

Offset: 1

Robert Price, Feb 02 2014

All terms are primes.

a(8) > 10^5.

J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.
H. Lifchitz, Mersenne and Fermat primes field
Eric Weisstein's World of Mathematics, Repunit.

Cf. A000978 = numbers n such that (2^n + 1)/3 is prime.

Cf. A007658, A057171, A057172, A057173, A057175, A001562, A057177, A057178, A057179, A057180, A057181, A057182, A057183, A057184, A057185, A057186, A057187, A057188, A057189, A057190, A057191, A071380, A071381, A071382, A084741, A084742, A065507, A126659, A126856, A185240, A229145, A229524, A230036, A229663, A231604, A231865, A235683, A236167, A236530.

Do[ p=Prime[n]; If[ PrimeQ[ (49^p + 1)/50 ], Print[p] ], {n, 1, 9592} ]

is(n)=ispseudoprime((49^n+1)/50) \\ Charles R Greathouse IV, Jun 13 2017

Typo in description corrected by Ray Chandler, Feb 20 2017

A247244 Smallest prime p such that (n^p + (n+1)^p)/(2n+1) is prime, or -1 if no such p exists.

Original entry on oeis.org

3, 3, 3, 5, 3, 3, 7, 3, 7, 53, 47, 3, 7, 3, 3, 41, 3, 5, 11, 3, 3, 11, 11, 3, 5, 103, 3, 37, 17, 7, 13, 37, 3, 269, 17, 5, 17, 3, 5, 139, 3, 11, 78697, 5, 17, 3671, 13, 491, 5, 3, 31, 43, 7, 3, 7, 2633, 3, 7, 3, 5, 349, 3, 41, 31, 5, 3, 7, 127, 3, 19, 3, 11, 19, 101, 3, 5, 3, 3

Offset: 1

Eric Chen, Nov 28 2014

nonn

All terms are odd primes.
a(79) > 10000, if it exists.
a(80)..a(93) = {3, 7, 13, 7, 19, 31, 13, 163, 797, 3, 3, 11, 13, 5}, a(95)..a(112) = {5, 2657, 19, 787, 3, 17, 3, 7, 11, 1009, 3, 61, 53, 2371, 5, 3, 3, 11}, a(114)..a(126) = {103, 461, 7, 3, 13, 3, 7, 5, 31, 41, 23, 41, 587}, a(128)..a(132) = {7, 13, 37, 3, 23}, a(n) is currently unknown for n = {79, 94, 113, 127, 133, ...} (see the status file under Links).

			a(10) = 53 because (10^p + 11^p)/21 is composite for all p < 53 and prime for p = 53.

Aurelien Gibier, Table of n, a(n) for n = 1..78 (first 42 terms from Robert G. Wilson v)
Robert G. Wilson v, Table of n, a(n) for n = 1..1000 with status of unknown terms [updated/edited by Jon E. Schoenfield]

Cf. A058013, A125713, A000978, A057469, A128066, A128335, A128336, A187805, A181141, A187819, A217095, A185239, A213216, A225097, A224984, A221637, A227170, A228573, A227171, A225818, A227172, A227173, A227174.

lmt = 4200; f[n_] := Block[{p = 2}, While[p < lmt && !PrimeQ[((n + 1)^p + n^p)/(2n + 1)], p = NextPrime@ p]; If[p > lmt, 0, p]]; Do[Print[{n, f[n] // Timing}], {n, 1000}] (* Robert G. Wilson v, Dec 01 2014 *)

a(n)=forprime(p=3, , if(ispseudoprime((n^p+(n+1)^p)/(2*n+1)), return(p)))

a(n) = 3 if and only if n^2 + n + 1 is a prime (A002384).

a(43) from Aurelien Gibier, Nov 27 2023

A283657 Numbers m such that 2^m + 1 has at most 2 distinct prime factors.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 19, 20, 23, 28, 31, 32, 40, 43, 61, 64, 79, 92, 101, 104, 127, 128, 148, 167, 191, 199, 256, 313, 347, 356, 596, 692, 701, 1004, 1228, 1268, 1709, 2617, 3539, 3824, 5807, 10501, 10691, 11279, 12391, 14479

Offset: 1

Vladimir Shevelev, Mar 13 2017

nonn

Using comment in A283364, note that if a(n) is odd > 9, then it is prime.
503 <= a(41) <= 596. - Robert Israel, Mar 13 2017
Could (4^p + 1)/5^t be prime, where p is prime, 5^t is the highest power of 5 dividing 4^p + 1, other than for p=2, 3 and 5? - Vladimir Shevelev, Mar 14 2017
In his message to seqfans from Mar 15 2017, Jack Brennen beautifully proved that there are no more primes of such form. From his proof one can see also that there are no terms of the form 2*p > 10 in the sequence. - Vladimir Shevelev, Mar 15 2017
Where A046799(n)=2. - Robert G. Wilson v, Mar 15 2017
From Giuseppe Coppoletta, May 16 2017: (Start)
The only terms that are not in A066263 are those m giving 2^m + 1 = prime (i.e. m = 0 and any number m such that 2^m + 1 is a Fermat prime) and the values of m giving 2^m + 1 = power of a prime, giving m = 3 as the only possible case (by Mihăilescu-Catalan's result, see links).
For the relation with Fermat numbers and for other possible terms to check, see comments in A073936 and A066263.
All terms after a(59) refer to probabilistic primality tests for 2^a(n) + 1  (see Caldwell's link for the list of the largest certified Wagstaff primes).
After a(65), the values 267017, 269987, 374321, 986191, 4031399 and 4101572 are also terms, but there still remains the remote possibility of some gaps in between. In addition, 13347311 and 13372531 are also terms, but possibly much further along in the numbering (see comments in A000978).
(End).

			0 is a term as 2^0 + 1 = 2 is a prime.
10 is a term as 2^10 + 1 = 5^2 * 41.
14 is not a term as 2^14 + 1 = 5 * 29 * 113.

Giuseppe Coppoletta, Table of n, a(n) for n = 1..65
Jack Brennen, Primes of the form (4^p+1)/5^t, Seqfan (Mar 15 2017).
C. Caldwell's The Top Twenty Wagstaff primes.
Mersennewiki, Factorizations Of Cunningham Numbers C+(2,n) (tables).
Samuel S. Wagstaff, The Cunningham Project.
Eric Weisstein's World of Mathematics, Catalan's Conjecture.
Eric Weisstein's World of Mathematics, Zsigmondy Theorem.

Cf. A002587, A046799, A283364, A073936, A000978, A127317, A092559, A019434, A066263.

Contains 4*A057182.

# this uses A002587[i] for i<=500, e.g., from the b-file for that sequence
count:= 0:
for i from 0 to 500 do
  m:= 0;
  r:= (2^i+1);
  if i::odd then
    m:= 1;
    r:= r/3^padic:-ordp(r,3);
  elif i > 2 then
    q:= max(numtheory:-factorset(i));
    if q > 2 then
      m:= 1;
      r:= r/B[i/q]^padic:-ordp(r,A002587[i/q]);
    fi
  fi;
  if r mod B[i] = 0 then m:= m+1;
      j:= padic:-ordp(r, A002587[i]);
      r:= r/B[i]^j;
  fi;
  mmax:= m;
  if isprime(r) then m:= m+1; mmax:= m
  elif r > 1 then mmax:= m+2
  fi;
  if mmax <= 2 or (m <= 1 and m + nops(numtheory:-factorset(r)) <= 2) then
       count:= count+1;
     A[count]:= i;
  fi
od:
seq(A[i],i=1..count); # Robert Israel, Mar 13 2017

Select[Range[0, 313], PrimeNu[2^# + 1]<3 &] (* Indranil Ghosh, Mar 13 2017 *)

for(n=0, 313, if(omega(2^n + 1)<3, print1(n,", "))) \\ Indranil Ghosh, Mar 13 2017

a(16)-a(38) from Peter J. C. Moses, Mar 13 2017
a(39)-a(40) from Robert Israel, Mar 13 2017
a(41)-a(65) from Giuseppe Coppoletta, May 08 2017

A309533 Numbers k such that (144^k + 1)/145 is prime.

Original entry on oeis.org

23, 41, 317, 3371, 45259, 119671

Offset: 1

Paul Bourdelais, Aug 06 2019

The corresponding primes are terms of A059055. - Bernard Schott, Aug 09 2019

Cf. A000978, A007658, A057171, A057172, A057173, A057175, A001562, A057177, A057178, A057179, A057180, A057181, A057182, A057183, A057184, A057185, A057186, A057187, A057188, A057189, A057190, A057191, A071380, A071381, A071382, A126856, A185240.

Do[p=Prime[n]; If[PrimeQ[(144^p + 1)/145], Print[p]], {n, 1, 1000000}]

PARI
```
is(n)=ispseudoprime((144^n+1)/145)
```

A033289 Odd power perfect numbers: numbers k such that opsigma(k) = 2*k, where opsigma(k) = A033634(k).

Original entry on oeis.org

6, 264, 45408, 10177920, 9310826880, 27806077440, 25437179036160, 303753589954560, 277875743791011840, 14504815632384, 13269098919960576, 2534919599177957376, 2318960803647990104064

Offset: 1

Yasutoshi Kohmoto

If x is OPP and x=2^k*y, gcd(2^k,y)=1, (2^(k+4)+1)/3 is prime, then 4*x*(2^(k+4)+1)/3 is also OPP.

By applying the rule above to a(12) we get that 1772040615644549459607552 is also a term. - Amiram Eldar, Aug 26 2022

Cf. A000978, A033634.

f[e_] := If[OddQ[e], e+2, e+1]; fun[p_, e_] := 1 + (p^f[e] - p)/(p^2 - 1); opsigma[1] = 1; opsigma[n_] := Times @@ fun @@@ FactorInteger[n]; Select[Range[50000], opsigma[#] == 2*# &] (* Amiram Eldar, Aug 26 2022 *)

{k: A033634(k) = 2*k}.

cp's OEIS Frontend

A127963 Number of 1's in A127962(n).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

Extensions

A127964 Number of 0's in the binary expansion of A127962(n).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

Extensions

A127965 Number of bits in A127962(n).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

Extensions

A194810 Indices k such that A139250(k) = A000979(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A235683 Numbers n such that (46^n + 1)/47 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A237052 Numbers n such that (49^n + 1)/50 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A247244 Smallest prime p such that (n^p + (n+1)^p)/(2n+1) is prime, or -1 if no such p exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A283657 Numbers m such that 2^m + 1 has at most 2 distinct prime factors.

Views

Author

Keywords

Comments