A000688 -id:A000688 - cp's OEIS frontend

A356068 Number of integers ranging from 1 to n that are not prime-powers (1 is not a prime-power).

1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 5, 6, 6, 6, 7, 7, 8, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 14, 15, 16, 17, 18, 18, 19, 20, 21, 21, 22, 22, 23, 24, 25, 25, 26, 26, 27, 28, 29, 29, 30, 31, 32, 33, 34, 34, 35, 35, 36, 37, 37, 38, 39, 39, 40, 41, 42

Offset: 1

Gus Wiseman, Jul 31 2022

nonn

			The a(30) = 14 numbers: 1, 6, 10, 12, 14, 15, 18, 20, 21, 22, 24, 26, 28, 30.

The complement is counted by A025528, with 1's A065515.
For primes instead of prime-powers we have A062298, with 1's A065855.
The version treating 1 as a prime-power is A085970.
One more than the partial sums of A143731.
A000688 counts factorizations into prime-powers.
A001222 counts prime-power divisors.
A246655 lists the prime-powers (A000961 includes 1), towers A164336.
Cf. A000720, A023894, A036234, A050361, A054685, A069513, A355743, A356064, A356065, A356066.

Table[Length[Select[Range[n],!PrimePowerQ[#]&]],{n,100}]

a(n) = A085970(n) + 1.

A376653 Sorted positions of first appearances in the second differences of consecutive prime-powers inclusive (A000961).

Original entry on oeis.org

1, 4, 5, 10, 12, 18, 25, 45, 47, 48, 60, 68, 69, 71, 80, 118, 121, 178, 179, 199, 206, 207, 216, 244, 245, 304, 325, 327, 402, 466, 484, 605, 801, 880, 939, 1033, 1055, 1077, 1234, 1281, 1721, 1890, 1891, 1906, 1940, 1960, 1962, 2257, 2290, 2410, 2880, 3150

Offset: 1

Gus Wiseman, Oct 06 2024

nonn

			The prime-powers inclusive (A000961) are:
  1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, ...
with first differences (A057820):
  1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 2, 4, 2, 2, 2, 2, 1, 5, 4, 2, 4, 2, 4, 6, 2, 3, ...
with first differences (A376596):
  0, 0, 0, 1, -1, 0, 1, 0, 1, -2, 1, 2, -2, 0, 0, 0, -1, 4, -1, -2, 2, -2, 2, 2, ...
with first appearances (A376653):
  1, 4, 5, 10, 12, 18, 25, 45, 47, 48, 60, 68, 69, 71, 80, 118, 121, 178, 179, 199, ...

For first differences we had A057820, sorted firsts A376340(n)+1 (except first term).
These are the sorted positions of first appearances in A376596.
The exclusive version is a(n) - 1 = A376654(n), except first term.
For squarefree instead of prime-power we have A376655.
A000961 lists prime-powers inclusive, exclusive A246655.
A001597 lists perfect-powers, complement A007916.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
A064113 lists positions of adjacent equal prime gaps.
For prime-powers inclusive: A057820 (first differences), A376597 (inflections and undulations), A376598 (nonzero curvature).
For second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376599 (non-prime-power).
Cf. A053707, A069623, A093555, A174965, A251092, A333254, A361102.

q=Differences[Select[Range[100],#==1||PrimePowerQ[#]&],2];
Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

A377053 Antidiagonal-sums of the absolute value of the array A377051(n,k) = n-th term of k-th differences of powers of primes.

Original entry on oeis.org

1, 3, 4, 5, 6, 13, 24, 45, 80, 123, 174, 229, 382, 1219, 3591, 8849, 19288, 37899, 67442, 108323, 156054, 206733, 311525, 860955, 2710374, 7111657, 17080759, 38884849, 85124764, 180097856, 368321633, 726482493, 1377039690, 2496856437, 4306569569, 7016267449

Offset: 0

Gus Wiseman, Oct 22 2024

nonn

These are the row-sums of the absolute value of the triangle-version of A377051.

			The sixth antidiagonal of A377051 is (8, 1, -1, -2, -3, -4, -5), so a(6) = 24.

The version for primes is A376681, noncomposites A376684, composites A377035.
For squarefree numbers we have A377040, nonsquarefree A377048.
This is the antidiagonal-sums of the absolute value of A377051.
The signed version is A377052.
For leaders we have A377054, for primes A007442 or A030016.
For first zero-positions we have A377055.
A version for partitions is A377056, cf. A175804, A053445, A281425, A320590.
A000040 lists the primes, differences A001223, seconds A036263.
A008578 lists the noncomposites, differences A075526.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
Cf. A000961, A025475, A053707, A057820, A069623, A093555, A174965, A246655, A361102, A376340, A376596.

nn=20;
t=Table[Differences[NestList[NestWhile[#+1&, #+1,!PrimePowerQ[#]&]&,1,2*nn],k],{k,0,nn}];
Total/@Abs[Table[t[[j,i-j+1]],{i,nn},{j,i}]]

A377055 Position of first appearance of zero in the n-th differences of the prime-powers (A246655), or 0 if it does not appear.

Original entry on oeis.org

0, 0, 1, 1, 4, 48, 61, 83, 29, 57, 290, 121, 7115, 14207, 68320, 14652, 149979, 122704, 481540, 980376, 632441, 29973, 25343678, 50577935, 7512418, 210836403, 67253056, 224083553, 910629561, 931524323, 452509699, 2880227533, 396690327, 57954538325, 77572935454, 35395016473

Offset: 0

Gus Wiseman, Oct 22 2024

nonn

			The fourth differences of A246655 begin: 1, -3, 3, 0, -2, 2, ... so a(4) = 4.

Lucas A. Brown, Python program.

The version for primes is A376678, noncomposites A376855, composites A377037.
For squarefree numbers we have A377042, nonsquarefree A377050.
These are the positions of first zeros in each row of A377051.
For antidiagonal-sums we have A377052, absolute A377053.
For leaders we have A377054, for primes A007442 or A030016.
A000040 lists the primes, differences A001223, seconds A036263.
A000961 lists the powers of primes, differences A057820.
A008578 lists the noncomposites, differences A075526.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
A246655 lists the prime-powers, differences A057820 (except first term).
Cf. A025475, A053707, A093555, A174965, A175804, A361102, A376340, A376596, A377056.

nn=10000;
u=Table[Differences[Select[Range[nn],PrimePowerQ],k],{k,2,16}];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
m=Table[Position[u[[k]],0][[1,1]], {k,mnrm[Union[First/@Position[u,0]]]}]

a(12)-a(27) from Pontus von Brömssen, Oct 22 2024
a(28)-a(30) from Chai Wah Wu, Oct 23 2024
a(31)-a(35) from Lucas A. Brown, Nov 03 2024

A356935 Numbers whose prime indices all have odd bigomega (number of prime factors with multiplicity). Products of primes indexed by elements of A026424. MM-numbers of finite multisets of finite odd-length multisets of positive integers.

Original entry on oeis.org

1, 3, 5, 9, 11, 15, 17, 19, 25, 27, 31, 33, 37, 41, 45, 51, 55, 57, 59, 61, 67, 71, 75, 81, 83, 85, 93, 95, 99, 103, 107, 109, 111, 113, 121, 123, 125, 127, 131, 135, 153, 155, 157, 165, 171, 177, 179, 181, 183, 185, 187, 191, 193, 197, 201, 205, 209, 211, 213

Offset: 1

Gus Wiseman, Sep 12 2022

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. We define the multiset of multisets with MM-number n to be formed by taking the multiset of prime indices of each part of the multiset of prime indices of n. The size of this multiset of multisets is A302242(n). For example, the prime indices of 78 are {1,2,6}, so the multiset of multisets with MM-number 78 is {{},{1},{1,2}}.

			The initial terms and corresponding multiset partitions:
   1: {}
   3: {{1}}
   5: {{2}}
   9: {{1},{1}}
  11: {{3}}
  15: {{1},{2}}
  17: {{4}}
  19: {{1,1,1}}
  25: {{2},{2}}
  27: {{1},{1},{1}}
  31: {{5}}
  33: {{1},{3}}
  37: {{1,1,2}}
  41: {{6}}
  45: {{1},{1},{2}}
  51: {{1},{4}}
  55: {{2},{3}}
  57: {{1},{1,1,1}}

Gus Wiseman, Counting and ranking classes of multiset partitions related to gapless multisets

A000041 counts integer partitions, strict A000009.
A000688 counts factorizations into prime powers.
A001055 counts factorizations.
A001221 counts prime divisors, sum A001414.
A001222 counts prime factors with multiplicity.
A056239 adds up prime indices, row sums of A112798.
Odd-size multisets are ctd by A000302, A027193, A058695, rkd by A026424.
Other types: A050330, A356932, A356933, A356934.
Other conditions: A302478, A302492, A356930, A356939, A356940, A356944, A356945.
Cf. A000040, A000720, A003963, A270995, A302242, A304969, A349050, A349055.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],OddQ[Times@@Length/@primeMS/@primeMS[#]]&]

A376654 Sorted positions of first appearances in the second differences of consecutive prime-powers exclusive (A246655).

Original entry on oeis.org

3, 4, 9, 11, 17, 24, 44, 46, 47, 59, 67, 68, 70, 79, 117, 120, 177, 178, 198, 205, 206, 215, 243, 244, 303, 324, 326, 401, 465, 483, 604, 800, 879, 938, 1032, 1054, 1076, 1233, 1280, 1720, 1889, 1890, 1905, 1939, 1959, 1961, 2256, 2289, 2409, 2879, 3149

Offset: 1

Gus Wiseman, Oct 06 2024

nonn

			The prime-powers exclusive (A246655) are:
  2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, ...
with first differences (A057820 except first term) :
  1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 2, 4, 2, 2, 2, 2, 1, 5, 4, 2, 4, 2, 4, 6, 2, 3, 3, ...
with first differences (A376596 except first term):
  0, 0, 1, -1, 0, 1, 0, 1, -2, 1, 2, -2, 0, 0, 0, -1, 4, -1, -2, 2, -2, 2, 2, -4, ...
with first appearances (A376654):
  1, 3, 4, 9, 11, 17, 24, 44, 46, 47, 59, 67, 68, 70, 79, 117, 120, 177, 178, 198, ...

For first differences we have A376340.
These are the sorted positions of first appearances in A376596 except first term.
The inclusive version is a(n) + 1 = A376653(n), except first term.
For squarefree instead of prime-power we have A376655.
A000961 lists prime-powers inclusive, exclusive A246655.
A001597 lists perfect-powers, complement A007916.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
For prime-powers inclusive: A057820 (first differences), A376597 (inflections and undulations), A376598 (nonzero curvature).
For second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376599 (non-prime-power).
Cf. A025475, A053707, A057820, A064113, A069623, A093555, A174965, A333254, A336416, A361102.

q=Differences[Select[Range[1000],PrimePowerQ[#]&],2];
Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

A046056 Smallest order for which there are n nonisomorphic finite Abelian groups, or 0 if no such order exists.

Original entry on oeis.org

1, 4, 8, 36, 16, 72, 32, 900, 216, 144, 64, 1800, 0, 288, 128, 44100, 0, 5400, 0, 3600, 864, 256, 0, 88200, 1296, 0, 27000, 7200, 0, 512, 0, 5336100, 1728, 0, 2592, 264600, 0, 0, 0, 176400, 0, 1024, 0, 2304, 3456, 0, 0, 10672200, 7776, 32400, 0, 0, 0, 1323000, 5184, 2048, 0, 0, 0, 4608

Offset: 1

Eric W. Weisstein

There is a k: A000688(k)=n if and only if n is product of partition numbers.

Charlie Neder, Table of n, a(n) for n = 1..1000
B. Horvat, G. Jaklic and T. Pisanski, On the number of Hamiltonian groups, arXiv:math/0503183 [math.CO], 2005.
Charlie Neder, Python program for computing this sequence.
Eric Weisstein's World of Mathematics, Abelian Group.
Index entries for sequences related to groups

Cf. A000041, A000688, A033637, A046054, A046055, A046057.

More terms from Christian G. Bower

a(20) and a(28) corrected, and a(52)-a(60) from Charlie Neder, Jan 17 2019

A255231 The number of factorizations n = Product_i b_i^e_i, where all bases b_i are distinct, and all exponents e_i are distinct >=1.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 2, 2, 1, 1, 1, 5, 1, 1, 1, 4, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 5, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 7, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 2, 2, 1, 1, 1, 5, 4, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 6, 1, 2, 2, 4, 1, 1, 1, 3, 1, 1, 1, 6, 1, 1, 1, 5, 1, 1, 1, 2, 2, 1, 1, 3

Offset: 1

Saverio Picozzi, Feb 18 2015

nonn

Not multiplicative: a(48) = a(2^4*3) = 5 <> a(2^4)*a(3) = 4*1 = 4. - R. J. Mathar, Nov 05 2016

			From _R. J. Mathar_, Nov 05 2016: (Start)
a(4)=2: 4^1 = 2^2.
a(8)=2: 8^1 = 2^3.
a(9)=2: 9^1 = 3^2.
a(12)=2: 12^1 = 2^2*3^1.
a(16)=4: 16^1 = 4^2 = 2^2*4^1 = 2^4.
a(18)=2: 18^1 = 2*3^2.
a(20)=2: 20^1 = 2^2*5^1.
a(24)=3: 24^1 = 2^2*6^1 = 2^3*3^1.
a(32)=5: 32^1 = 2^1*4^2 = 2^2*8^1 = 2^3*4^1 = 2^5.
a(36)=4: 36^1 = 6^2 = 3^2*4^1 = 2^2*9^1.
a(48)=5: 48^1 = 3^1*4^2 = 2^2*12^1 = 2^3*6^1 = 2^4*3^1.
a(60)=2 : 60^1 = 2^2*15^1.
a(64)=7: 64^1 = 8^2 = 4^3 = 2^2*16^1 = 2^3*8^1 = 2^4*4^1 = 2^6.
a(72)=6 : 72^1 = 3^2*8^1 = 2^1*6^2 = 2^2*18^1 = 2^3*9^1 = 2^3*3^2.
(End)

R. J. Mathar, Table of n, a(n) for n = 1..419
R. J. Mathar, Factorizations of integers into factors with distinct bases and exponents
Index to sequences related to prime signature

Cf. A000688 (b_i not necessarily distinct).

Cf. A001248, A005117, A030078, A030514, A054753, A065036, A085986, A085987, A143610, A178739.

# Count solutions for products if n = dvs_i^exps(i) where i=1..pividx are fixed
Apiv := proc(n,dvs,exps,pividx)
    local dvscnt, expscopy,i,a,expsrt,e ;
    dvscnt := nops(dvs) ;
    a := 0 ;
    if pividx > dvscnt then
        # have exhausted the exponent list: leave of the recursion
        # check that dvs_i^exps(i) is a representation
        if n = mul( op(i,dvs)^op(i,exps),i=1..dvscnt) then
            # construct list of non-0 exponents
            expsrt := [];
            for i from 1 to dvscnt do
                if op(i,exps) > 0 then
                    expsrt := [op(expsrt),op(i,exps)] ;
                end if;
            end do;
            # check that list is duplicate-free
            if nops(expsrt) = nops( convert(expsrt,set)) then
                return 1;
            else
                return 0;
            end if;
        else
            return 0 ;
        end if;
    end if;
    # need a local copy of the list to modify it
    expscopy := [] ;
    for i from 1 to nops(exps) do
        expscopy := [op(expscopy),op(i,exps)] ;
    end do:
    # loop over all exponents assigned to the next base in the list.
    for e from 0 do
        candf := op(pividx,dvs)^e ;
        if modp(n,candf) <> 0 then
            break;
        end if;
        # assign e to the local copy of exponents
        expscopy := subsop(pividx=e,expscopy) ;
        a := a+procname(n,dvs,expscopy,pividx+1) ;
    end do:
    return a;
end proc:
A255231 := proc(n)
    local dvs,dvscnt,exps ;
    if n = 1 then
        return 1;
    end if;
    # candidates for the bases are all divisors except 1
    dvs := convert(numtheory[divisors](n) minus {1},list) ;
    dvscnt := nops(dvs) ;
    # list of exponents starts at all-0 and is
    # increased recursively
    exps := [seq(0,e=1..dvscnt)] ;
    # take any subset of dvs for the bases, i.e. exponents 0 upwards
    Apiv(n,dvs,exps,1) ;
end proc:
seq(A255231(n),n=1..120) ; # R. J. Mathar, Nov 05 2016

a(n)=1 for all n in A005117. a(n)=2 for all n in A001248 and for all n in A054753 and for all n in A085987 and for all n in A030078. a(n)=3 for all n in A065036. a(n)=4 for all n in A085986 and for all n in A030514. a(n)=5 for all n in A178739, all n in A179644 and for all n in A050997. a(n)=6 for all n in A143610, all n in A162142 and all n in A178740. a(n)=7 for all n in A030516. a(n)=9 for all n in A189988 and all n in A189987. a(n)=10 for all n in A092759. a(n) = 11 for all n in A179664. a(n)=12 for all n in A179646. - R. J. Mathar, Nov 05 2016, May 20 2017

Values corrected. Incorrect comments removed. - R. J. Mathar, Nov 05 2016

A275977 Decimal expansion of 2^9689 - 1, the 21st Mersenne prime A000668(21).

Original entry on oeis.org

4, 7, 8, 2, 2, 0, 2, 7, 8, 8, 0, 5, 4, 6, 1, 2, 0, 2, 9, 5, 2, 8, 3, 9, 2, 9, 8, 6, 6, 0, 0, 0, 5, 9, 0, 9, 7, 4, 1, 4, 9, 7, 1, 7, 2, 4, 0, 2, 2, 3, 6, 5, 0, 0, 8, 5, 1, 3, 3, 4, 5, 1, 0, 9, 9, 1, 8, 3, 7, 8, 9, 5, 0, 9, 4, 2, 6, 6, 2, 9, 7, 0, 2, 7, 8, 9, 2, 7, 6, 8, 6, 1, 1, 2, 7, 0, 7, 8, 9, 4, 5, 8, 6, 8, 2

Offset: 2917

Arkadiusz Wesolowski, Aug 15 2016

			47822027880546120295283929866000590974149717240223650085133451099183789...

Arkadiusz Wesolowski, Table of n, a(n) for n = 2917..5833
Wikipedia, Mersenne prime

Cf. A169684 = A000668(11), A169681 = A000668(12), A169685 = A000668(13), A204063 = A000668(14), A248931 = A000668(15), A248932 = A000688(16), A248933 = A000668(17), A248934 = A000668(18), A248935 = A000668(19), A248936 = A000668(20), A275979 = A000668(22), A275980 = A000668(23), A275981 = A000668(24), A275982 = A000668(25), A275983 = A000668(26), A275984 = A000668(27).

Magma
```
Reverse(Intseq(2^9689-1))[1..105];
```

First@RealDigits@N[2^9689 - 1, 100] (* G. C. Greubel, Aug 15 2016 *)
RealDigits[2^MersennePrimeExponent[21]-1,10,120][[1]] (* Harvey P. Dale, Aug 14 2025 *)

PARI
```
eval(Vec(Str(2^9689-1)))[1..105]
```

2^A000043(21) - 1.

A275979 Decimal expansion of 2^9941 - 1, the 22nd Mersenne prime A000668(22).

Original entry on oeis.org

3, 4, 6, 0, 8, 8, 2, 8, 2, 4, 9, 0, 8, 5, 1, 2, 1, 5, 2, 4, 2, 9, 6, 0, 3, 9, 5, 7, 6, 7, 4, 1, 3, 3, 1, 6, 7, 2, 2, 6, 2, 8, 6, 6, 8, 9, 0, 0, 2, 3, 8, 5, 4, 7, 7, 9, 0, 4, 8, 9, 2, 8, 3, 4, 4, 5, 0, 0, 6, 2, 2, 0, 8, 0, 9, 8, 3, 4, 1, 1, 4, 4, 6, 4, 3, 6, 4, 3, 7, 5, 5, 4, 4, 1, 5, 3, 7, 0, 7, 5, 3, 3, 6, 6, 4

Offset: 2993

Arkadiusz Wesolowski, Aug 15 2016

			34608828249085121524296039576741331672262866890023854779048928344500622...

Arkadiusz Wesolowski, Table of n, a(n) for n = 2993..5985
Wikipedia, Mersenne prime

Cf. A169684 = A000668(11), A169681 = A000668(12), A169685 = A000668(13), A204063 = A000668(14), A248931 = A000668(15), A248932 = A000688(16), A248933 = A000668(17), A248934 = A000668(18), A248935 = A000668(19), A248936 = A000668(20), A275977 = A000668(21), A275980 = A000668(23), A275981 = A000668(24), A275982 = A000668(25), A275983 = A000668(26), A275984 = A000668(27).

Magma
```
Reverse(Intseq(2^9941-1))[1..105];
```

First@RealDigits@N[2^9941 - 1, 100] (* G. C. Greubel, Aug 15 2016 *)

PARI
```
eval(Vec(Str(2^9941-1)))[1..105]
```

2^A000043(22) - 1.

cp's OEIS Frontend

A356068 Number of integers ranging from 1 to n that are not prime-powers (1 is not a prime-power).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A376653 Sorted positions of first appearances in the second differences of consecutive prime-powers inclusive (A000961).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A377053 Antidiagonal-sums of the absolute value of the array A377051(n,k) = n-th term of k-th differences of powers of primes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A377055 Position of first appearance of zero in the n-th differences of the prime-powers (A246655), or 0 if it does not appear.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A356935 Numbers whose prime indices all have odd bigomega (number of prime factors with multiplicity). Products of primes indexed by elements of A026424. MM-numbers of finite multisets of finite odd-length multisets of positive integers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A376654 Sorted positions of first appearances in the second differences of consecutive prime-powers exclusive (A246655).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A046056 Smallest order for which there are n nonisomorphic finite Abelian groups, or 0 if no such order exists.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A255231 The number of factorizations n = Product_i b_i^e_i, where all bases b_i are distinct, and all exponents e_i are distinct >=1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

Extensions

A275977 Decimal expansion of 2^9689 - 1, the 21st Mersenne prime A000668(21).

Views

Author

Keywords

Examples