A085104 -id:A085104 - cp's OEIS frontend

A053183 Primes of the form p^2 + p + 1 when p is prime.

7, 13, 31, 307, 1723, 3541, 5113, 8011, 10303, 17293, 28057, 30103, 86143, 147073, 459007, 492103, 552793, 579883, 598303, 684757, 704761, 735307, 830833, 1191373, 1204507, 1353733, 1395943, 1424443, 1482307, 1886503, 2037757

Offset: 1

Enoch Haga, Mar 01 2000

Also primes in A001001. - Philippe Deléham, Feb 21 2004
This sequence is a subsequence of A002383. These numbers are repunit primes 111_n, so they are Brazilian primes belonging to A085104. - Bernard Schott, Dec 21 2012
Also, primes in A060800. - Zak Seidov, Mar 21 2014
Also subsequence of A002061, A193574. - Hartmut F. W. Hoft, May 05 2017
As p^2 + p + 1 is the sum of divisors of p^2 for any prime p, this is a subsequence of A023195. - Peter Munn, Feb 16 2018

Zak Seidov, Table of n, a(n) for n = 1..1000

Cf. A002383, A002384, A023195, A053182, A060800, A065764, A085104, A182253, A185632.

Cf. A002061, A193574. - Hartmut F. W. Hoft, May 05 2017

a053183[n_] := Select[Map[Prime[#]^2 + Prime[#] + 1&, Range[n]], PrimeQ]
a053183[225] (* data *) (* Hartmut F. W. Hoft, May 05 2017 *)
Select[Table[p^2+p+1,{p,Prime[Range[300]]}],PrimeQ] (* Harvey P. Dale, Aug 15 2017 *)

a(n) = A053182(n)^2 + A053182(n) + 1.

A060072 a(n) = (n^(n-1) - 1)/(n-1) for n>1, a(1) = 0.

Original entry on oeis.org

0, 1, 4, 21, 156, 1555, 19608, 299593, 5380840, 111111111, 2593742460, 67546215517, 1941507093540, 61054982558011, 2085209001813616, 76861433640456465, 3041324492229179280, 128583032925805678351, 5784852794328402307380, 275941052631578947368421

Offset: 1

Henry Bottomley, Feb 21 2001

nonn

(n-1)-digit repunits in base n written in decimal.

			a(10)=111111111; i.e., just nine 1's (converted from base 10 to decimal).

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

Cf. A000169, A037205, A055869, A060073, A125118, A228275.

Cf. other sequences of generalized repunits, such as A053696, A055129, A031973, A125598, A173468, A023037, A119598, A085104, and A162861.

[0] cat [ (n^(n-1) -1)/(n-1) : n in [2..25]]; // G. C. Greubel, Aug 15 2022

Join[{0},Array[(#^(#-1)-1)/(#-1)&,20,2]] (* Harvey P. Dale, Jun 04 2013 *)

a(n) = if (n==1, 0, (n^(n - 1) - 1)/(n - 1)); \\ Harry J. Smith, Jul 01 2009

[0]+[(n^(n-1) -1)/(n-1) for n in (2..25)] # G. C. Greubel, Aug 15 2022

a(n+1) = Sum_{k=1..n} n^(k-1)*C(n, k). - Olivier Gérard, Jun 26 2001 [Corrected by Mathew Englander, Dec 15 2020]
a(n) = Sum_{j=2..n} n^(n-j). - Zerinvary Lajos, Sep 11 2006
a(n+1) = A125118(n,n). - Reinhard Zumkeller, Nov 21 2006
a(n) = Integral_{x=1/n..1} 1/x^n dx. - Francesco Daddi, Aug 01 2011
a(n) = A037205(n-1)/(n-1) = A060073(n)*(n-1) = A023037(n) - A000169(n).
a(n) = [x^n] x^2/((1 - x)*(1 - n*x)). - Ilya Gutkovskiy, Oct 04 2017
a(n) = 1 + A228275(n, n-2) for n >= 2. - Mathew Englander, Dec 14 2020

Name edited by Michel Marcus, Dec 14 2020

A220627 Prime numbers that are not Brazilian.

Original entry on oeis.org

2, 3, 5, 11, 17, 19, 23, 29, 37, 41, 47, 53, 59, 61, 67, 71, 79, 83, 89, 97, 101, 103, 107, 109, 113, 131, 137, 139, 149, 151, 163, 167, 173, 179, 181, 191, 193, 197, 199, 223, 227, 229, 233, 239, 251, 257, 263, 269, 271, 277, 281, 283, 293, 311, 313, 317

Offset: 1

Bernard Schott, Dec 17 2012

These are primes not in A085104 (Brazilian primes).

Primes that are not repunit in any base b >= 2 with three or more digits.

T. D. Noe, Table of n, a(n) for n = 1..1000
Bernard Schott, Les nombres brésiliens, Quadrature, no. 76, avril-juin 2010, pages 30-38; included here with permission from the editors of Quadrature.

Cf. A085104.

brazBases[n_] := Select[Range[2, n - 2], Length[Union[IntegerDigits[n, #]]] == 1 &]; Select[Range[2, 1000], PrimeQ[#] && brazBases[#] == {} &] (* T. D. Noe, Dec 26 2012 *)

isok(p) = {if (isprime(p), for (b=2, p-1, my(d=digits(p, b), md=vecmin(d)); if ((#d > 2) && (md == 1) && (vecmax(d) == 1), return (0));); return (1););} \\ Michel Marcus, Apr 30 2021

from sympy.ntheory.factor_ import digits
from sympy import isprime, primerange
def B(n):
    l=[]
    for b in range(2, n - 1):
        d=digits(n, b)[1:]
        if max(d)==min(d): l.append(n)
    return l
print([n for n in primerange(2, 1001) if not B(n)]) # Indranil Ghosh, Jun 22 2017

A088548 Primes of the form k^4 + k^3 + k^2 + k + 1.

Original entry on oeis.org

5, 31, 2801, 22621, 30941, 88741, 245411, 292561, 346201, 637421, 732541, 837931, 2625641, 3500201, 3835261, 6377551, 15018571, 16007041, 21700501, 28792661, 30397351, 35615581, 39449441, 48037081, 52822061, 78914411, 97039801, 147753211, 189004141, 195534851

Offset: 1

Cino Hilliard, Nov 17 2003

These numbers when >= 31 are primes repunits 11111_n in a base n >= 2, so except 5, they are all Brazilian primes belonging to A085104. (See Links "Les nombres brésiliens", § V.4 - § V.5.) A008858 is generated by the bases n present in A049409. - Bernard Schott, Dec 19 2012

			a(2) = 31 is prime and 31 = 2^4 + 2^3 + 2^2 + 2 + 1.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Bernard Schott, Les nombres brésiliens, Quadrature, no. 76, avril-juin 2010, pages 30-38; included here with permission from the editors of Quadrature.

Cf. A002383, A049409, A085104, A088550.

[a: n in [0..200] | IsPrime(a) where a is n^4+n^3+n^2+n+1]; // Vincenzo Librandi, Jul 16 2012

lst={}; Do[a=1+n+n^2+n^3+n^4; If[PrimeQ[a], AppendTo[lst,a]], {n,6!}]; lst (* Vladimir Joseph Stephan Orlovsky, Jun 02 2009 *)
Select[Table[n^4+n^3+n^2+n+1, {n,0,2000}], PrimeQ] (* Vincenzo Librandi, Jul 16 2012 *)

polypn(n,p) = { for(x=1,n, if(p%2,y=2,y=1); for(m=1,p, y=y+x^m; ); if(isprime(y),print1(y",")); ) }

from sympy import isprime
print(list(filter(isprime, (k**4+k**3+k**2+k+1 for k in range(120))))) # Michael S. Branicky, May 31 2021

A000040 intersect A053699. - R. J. Mathar, Feb 07 2014

A088550 Primes of the form n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.

Original entry on oeis.org

7, 127, 1093, 19531, 55987, 5229043, 8108731, 25646167, 321272407, 917087137, 3092313043, 4201025641, 9684836827, 31401724537, 47446779661, 52379047267, 83925549247, 100343116693, 141276239497, 153436090543, 265462278481

Offset: 1

Cino Hilliard, Nov 17 2003

These numbers, starting with 127, are repunit primes 1111111_n in a base n >= 2, so except 7, they are all Brazilian primes belonging to A085104. In fact, 7 = 111_2 is also Brazilian by this other way. (See Links "Les nombres brésiliens", § V.4 -§ V.5.) A088550 is generated by the bases n present in A100330. - Bernard Schott, Dec 20 2012

			a(3) = 1093 = 3^6 + 3^5 + 3^4 + 3^3 + 3^2 + 3 + 1 is prime.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Bernard Schott, Les nombres brésiliens, Quadrature, no. 76, avril-juin 2010, pages 30-38.
Bernard Schott, Les nombres brésiliens, Reprinted from Quadrature, no. 76, avril-juin 2010, pages 30-38, included here with permission from the editors of Quadrature.

Cf. A085104, A100330.

[a: n in [0..100] | IsPrime(a) where a is 1+n+n^2+n^3+n^4+n^5+n^6] ; // Vincenzo Librandi, Jul 14 2012

A088550 := proc(n)
    numtheory[cyclotomic](7,A100330(n)) ;
end proc:
seq(A088550(n),n=1..30) ;

Select[Table[n^6 + n^5 + n^4 + n^3 + n^2 + n + 1, {n, 100}], PrimeQ] (* Alonso del Arte, Feb 07 2014 *)
Select[Table[Total[n^Range[0,6]],{n,100}],PrimeQ] (* Harvey P. Dale, Aug 13 2024 *)

polypn(n,p) = { for(x=1,n, if(p%2,y=2,y=1); for(m=1,p, y=y+x^m; ); if(isprime(y),print1(y",")); ) }

A059055 Primes which can be written as (b^k+1)/(b+1) for positive integers b and k.

Original entry on oeis.org

3, 7, 11, 13, 31, 43, 61, 73, 157, 211, 241, 307, 421, 463, 521, 547, 601, 683, 757, 1123, 1483, 1723, 2551, 2731, 2971, 3307, 3541, 3907, 4423, 4831, 5113, 5701, 6007, 6163, 6481, 8011, 8191, 9091, 9901, 10303, 11131, 12211, 12433, 13421, 13807, 14281

Offset: 1

Henry Bottomley, Dec 21 2000

For (b^k+1)/(b+1) to be a prime, k must be an odd prime. 2=(0^0+1)/(0+1) has been excluded since neither b nor k would be positive.
From Bernard Schott, Apr 30 2021: (Start)
43 is the only known prime to have two such representations (examples).
The next two sequences realize a partition of this set: Brazilian primes of the form (c^q-1)/(c-1) (A002383 \ {3}) and primes that are not Brazilian (A343774). (End)

			43 is in the sequence since (2^7+1)/(2+1) = 129/3 = 43; indeed also (7^3+1)/(7+1) = 344/8 = 43.

Giovanni Resta, Table of n, a(n) for n = 1..10000 (first 3880 terms from T. D. Noe)
H. Dubner and T. Granlund, Primes of the Form (b^n+1)/(b+1), J. Integer Sequences, 3 (2000), #P00.2.7.

Cf. A002383, A059054.

Cf. A003424, A085104.

max = 89; maxdata = (1 + max^3)/(1 + max); a = {}; Do[i = 1; While[i = i + 2; cc = (1 + m^i)/(1 + m); cc <= maxdata, If[PrimeQ[cc], a = Append[a, cc]]], {m, 2, max}]; Union[a] (* Lei Zhou, Feb 08 2012 *)

isok(p) = {if (isprime(p), for (b=2, p, my(k=3); while ((x=(b^k+1)/(b+1)) <= p, if (x == p, return (1)); k = nextprime(k+1););););} \\ Michel Marcus, Apr 30 2021

A326380 Numbers m such that beta(m) = tau(m)/2 where beta(m) is the number of Brazilian representations of m and tau(m) is the number of divisors of m.

Original entry on oeis.org

7, 13, 15, 21, 26, 40, 43, 57, 62, 73, 80, 85, 86, 91, 93, 111, 114, 124, 127, 129, 133, 146, 157, 170, 171, 172, 183, 211, 215, 219, 222, 228, 241, 242, 259, 266, 285, 292, 307, 312, 314, 333, 341, 343, 365, 366, 381, 399, 421, 422, 438, 444, 455, 463, 468, 471, 482, 507, 518, 532, 549, 553, 555, 585, 601, 614, 624

Offset: 1

Bernard Schott, Jul 03 2019

As tau(m) = 2 * beta(m), the terms of this sequence are not squares. Indeed, there are 3 subsequences which realize a partition of this sequence (see examples):
1) Non-oblong composites which have only one Brazilian representation with three digits or more, they form A326387.
2) Oblong numbers that have exactly two Brazilian representations with three digits or more; these oblong integers are a subsequence of A167783 and form A326385.
3) Brazilian primes for which beta(p) = tau(p)/2 = 1, they are in A085104 \ {31, 8191}.

			One example for each type:
15 = 1111_2 = 33_4 with tau(15) = 4 and beta(15) = 2.
3906 = 62 * 63 = 111111_5 = 666_25 = (42,42)_86 = (31,31)_125 = (21,21)_185 = (18,18)_216 = (14,14)_278 = 99_433 = 77_557 = 66_650 = 33_1301 = 22_1952, so tau(3906) = 24 with beta(3906) = 12.
43 = 111_6 is Brazilian prime, so tau(43) = 2 and beta(43) = 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for sequences related to Brazilian numbers.

Cf. A000005 (tau), A220136 (beta).
Cf. A085104 (Brazilian primes).
Subsequence of A167782.
Cf. A326378 (tau(m)/2 - 2), A326379 (tau(m)/2 - 1), A326381 (tau(m)/2 + 1), A326382 (tau(m)/2 + 2), A326383 (tau(m)/2 + 3).

beta(n) = sum(i=2, n-2, #vecsort(digits(n, i), , 8)==1); \\ A220136
isok(n) = beta(n) == numdiv(n)/2; \\ Michel Marcus, Jul 03 2019

A119598 Numbers that are repunits in four or more bases.

Original entry on oeis.org

1, 31, 8191

Offset: 1

Sergio Pimentel, Jun 01 2006

Except for first term, numbers which can be represented as a string of three or more 1's in a base >=2 in more than one way; subset of A053696.
No more terms less than 2^44 = 17592186044416. - Ray Chandler, Jun 08 2006
Let the 4-tuple (a,b,m,n) be a solution to the exponential Diophantine equation (a^m-1)/(a-1)=(b^n-1)/(b-1) with a>1, b>a, m>2 and n>2. Then (a^m-1)/(a-1) is in this sequence. The terms 31 and 8191 correspond to the solutions (2,5,5,3) and (2,90,13,3), respectively. No other solutions with n=3 and b<10^5. The Mathematica code finds repunits in increasing order and prints solutions. - T. D. Noe, Jun 07 2006
Following the Goormaghtigh conjecture (Links), 31 and 8191 which are both Mersenne numbers, are the only primes which are Brazilian in two different bases. - Bernard Schott, Jun 25 2013

			a(1)=1 is a repunit in every base. a(2)=31 is a repunit in bases 1, 2, 5 and 30. a(3)=8191 is a repunit in bases 1, 2, 90 and 8190.
31 and 8191 are Brazilian numbers in two different bases:
31 = 11111_2 = 111_5,
8191 = 1111111111111_2 = 111_90.

Y. Bugeaud and T. N. Shorey, On the diophantine equation (x^m - 1)/(x-1) = (y^n - 1)/(y-1), Pacific Journal of Mathematics 207:1 (2002), pp. 61-75.
Jon Grantham, No new Goormaghtigh primes up to 10^700, arXiv:2410.03677 [math.NT], 2024.
Eric Weisstein's World of Mathematics, Repunit
Wikipedia, Goormaghtigh conjecture

Cf. A002275, A053696, A055129, A088323.
Cf. A053696 (numbers of the form (b^k-1)/(b-1)).
Cf. A145461: bases 5 and 90 are 2 exceptions (Goormaghtigh's conjecture).
Cf. A085104 (Brazilian primes).

fQ[n_] := Block[{d = Rest@Divisors[n - 1]}, Length@d > 2 && Length@Select[IntegerDigits[n, d], Union@# == {1} &] > 2]; Do[ If[ fQ@n, Print@n], {n, 10^8/3}] (* Robert G. Wilson v *)
nn=1000; pow=Table[3, {nn}]; t=Table[If[n==1, Infinity, (n^3-1)/(n-1)], {n,nn}]; While[pos=Flatten[Position[t,Min[t]]]; !MemberQ[pos,nn], If[Length[pos]>1, Print[{pos,pow[[pos]],t[[pos[[1]]]]}]]; Do[n=pos[[i]]; pow[[n]]++; t[[n]]=(n^pow[[n]]-1)/(n-1), {i,Length[pos]}]] (* T. D. Noe, Jun 07 2006 *)

def isrep(n, b):
  while n >= b:
    n, r = divmod(n, b)
    if r != 1: return False
  return n == 1
def agen():
  yield 1
  n = 2
  while True:
    reps = 2 # n is a repunit in bases 1 and n-1
    for b in range(2, n-1):
      if isrep(n, b): reps += 1
      if reps == 4: yield n; break
    n += 1
for m in agen(): print(m) # Michael S. Branicky, Jan 31 2021

Edited by Ray Chandler, Jun 08 2006

A003424 Primes of form (p^x - 1)/(p^y - 1), p prime.

Original entry on oeis.org

3, 5, 7, 13, 17, 31, 73, 127, 257, 307, 757, 1093, 1723, 2801, 3541, 5113, 8011, 8191, 10303, 17293, 19531, 28057, 30103, 30941, 65537, 86143, 88741, 131071, 147073

Offset: 1

N. J. A. Sloane

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..4738 (terms less than 10^12)
Paul T. Bateman and Rosemarie M. Stemmler, Waring's problem for algebraic number fields and primes of the form (p^r-1)/(p^d-1), Illinois J. Math. 6 (1962), pp. 142-156.
Bernard Schott, Les nombres brésiliens, Quadrature, no. 76, avril-juin 2010, pages 30-38; included here with permission from the editors of Quadrature.
Leonard Tornheim, Sums of n-th powers in fields of prime characteristic, Duke Math. J. 4 (1938), pp. 359-362.

Cf. A059055, A085104.

A128164 Least k > 2 such that (n^k - 1)/(n-1) is prime, or 0 if no such prime exists.

Original entry on oeis.org

3, 3, 0, 3, 3, 5, 3, 0, 19, 17, 3, 5, 3, 3, 0, 3, 25667, 19, 3, 3, 5, 5, 3, 0, 7, 3, 5, 5, 5, 7, 0, 3, 13, 313, 0, 13, 3, 349, 5, 3, 1319, 5, 5, 19, 7, 127, 19, 0, 3, 4229, 103, 11, 3, 17, 7, 3, 41, 3, 7, 7, 3, 5, 0, 19, 3, 19, 5, 3, 29, 3, 7, 5, 5, 3, 41, 3, 3, 5, 3, 0, 23, 5, 17, 5, 11, 7, 61, 3, 3

Offset: 2

Alexander Adamchuk, Feb 20 2007

nonn

a(n) = A084740(n) for all n except n = p-1, where p is an odd prime, for which A084740(n) = 2.
All nonzero terms are odd primes.
a(n) = 0 for n = {4,9,16,25,32,36,49,64,81,100,121,125,144,...}, which are the perfect powers with exceptions of the form n^(p^m) where p>2 and (n^(p^(m+1))-1)/(n^(p^m)-1) are prime and m>=1 (in which case a(n^(p^m))=p). - Max Alekseyev, Jan 24 2009
a(n) = 3 for n in A002384, i.e., for n such that n^2 + n + 1 is prime.
a(152) > 20000. - Eric Chen, Jun 01 2015
a(n) is the least number k such that (n^k - 1)/(n-1) is a Brazilian prime, or 0 if no such Brazilian prime exists. - Bernard Schott, Apr 23 2017
These corresponding Brazilian primes are in A285642. - Bernard Schott, Aug 10 2017
a(152) = 270217, see the top PRP link. - Eric Chen, Jun 04 2018
a(184) = 16703, a(200) = 17807, a(210) = 19819, a(306) = 26407, a(311) = 36497, a(326) = 26713, a(331) = 25033; a(185) > 66337, a(269) > 63659, a(281) > 63421, and there are 48 unknown a(n) for n <= 1024. - Eric Chen, Jun 04 2018
Six more terms found: a(522)=20183, a(570)=12907, a(684)=22573, a(731)=15427, a(820)=12043, a(996)=14629. - Michael Stocker, Apr 09 2020

			a(7) = 5 because (7^5 - 1)/6 = 2801 = 11111_7 is prime and (7^k - 1)/6 = 1, 8, 57, 400 for k = 1, 2, 3, 4. - _Bernard Schott_, Apr 23 2017

Max Alekseyev and Eric Chen, Table of n, a(n) for n = 2..184 (terms 2..151 from Max Alekseyev)
Eric Chen, Table of n, a(n) for n = 2..1024 status (updated by Jinyuan Wang)
H. Dubner, Generalized repunit primes, Math. Comp., 61 (1993), 927-930.
Richard Fischer, Generalized repunit primes of the form (B^N-1)/(B-1)
Top PRPs, Search by (152^n-1)/(152-1)
Top PRPs, Search by (b^n-1)/a
Eric Weisstein's World of Mathematics, Repunit

Cf. A084738, A065854, A084740, A084741, A065507, A084742, A066180, A084732, A285642, A085104.
Cf. A002384, A049409, A100330, A162862, A217070-A217089. (numbers b such that (b^p-1)/(b-1) is prime for prime p = 3 to 97)
Cf. A000043, A028491, A004061, A004062, A004063, A004023, A005808, A004064, A016054, A006032, A006033, A006034, A133857, A006035, A127995, A127996, A127997, A204940, A127998, A127999, A128000, A181979, A098438, A128002, A209120, A185073, A128003, A128004, A181987, A128005, A239637, A240765, A294722, A242797, A243279, A267375, A245237, A245442, A173767. (numbers n such that (b^n-1)/(b-1) is prime for b = 2 to 53)
A126589 gives locations of zeros.

Table[Function[m, If[m > 0, k = 3; While[! PrimeQ[(m^k - 1)/(m - 1)], k++]; k, 0]]@ If[Set[e, GCD @@ #[[All, -1]]] > 1, {#, IntegerExponent[n, #]} &@ Power[n, 1/e] /. {{k_, m_} /; Or[Not[PrimePowerQ@ m], Prime@ m, FactorInteger[m][[1, 1]] == 2] :> 0, {k_, m_} /; m > 1 :> n}, n] &@ FactorInteger@ n, {n, 2, 17}] (* Michael De Vlieger, Apr 24 2017 *)

a052409(n) = my(k=ispower(n)); if(k, k, n>1)
a052410(n) = if (ispower(n, , &r), r, n)
is(n) = issquare(n) || (ispower(n) && !ispseudoprime((n^a052410(a052409(n))-1)/(n-1)))
a(n) = if(is(n), 0, forprime(p=3, 2^16, if(ispseudoprime((n^p-1)/(n-1)), return(p)))) \\ Eric Chen, Jun 01 2015, corrected by Eric Chen, Jun 04 2018, after Charles R Greathouse IV in A052409 and Michel Marcus in A052410

a(18) = 25667 found by Henri Lifchitz, Sep 26 2007

cp's OEIS Frontend

A053183 Primes of the form p^2 + p + 1 when p is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A060072 a(n) = (n^(n-1) - 1)/(n-1) for n>1, a(1) = 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

Extensions

A220627 Prime numbers that are not Brazilian.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

A088548 Primes of the form k^4 + k^3 + k^2 + k + 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Formula

A088550 Primes of the form n^6 + n^5 + n^4 + n^3 + n^2 + n + 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

A059055 Primes which can be written as (b^k+1)/(b+1) for positive integers b and k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A326380 Numbers m such that beta(m) = tau(m)/2 where beta(m) is the number of Brazilian representations of m and tau(m) is the number of divisors of m.

Views

Author

Keywords

Comments