A035100 -id:A035100 - cp's OEIS frontend

A372472 Number of zeros in the binary expansion of the n-th squarefree number.

0, 1, 0, 1, 1, 0, 2, 1, 1, 1, 0, 3, 2, 2, 2, 1, 2, 1, 1, 0, 4, 4, 3, 3, 3, 2, 3, 3, 2, 2, 1, 2, 2, 1, 2, 2, 1, 1, 1, 5, 5, 4, 4, 4, 3, 4, 4, 3, 3, 2, 4, 3, 3, 3, 2, 3, 2, 2, 2, 1, 4, 3, 3, 2, 3, 3, 2, 2, 2, 1, 3, 3, 2, 2, 1, 2, 1, 0, 6, 6, 5, 5, 5, 5, 5, 4, 4

Offset: 1

Gus Wiseman, May 09 2024

			The 12th squarefree number is 17, with binary expansion (1,0,0,0,1), so a(12) = 3.

Positions of first appearances are A372473.
Restriction of A023416 to A005117.
For prime instead of squarefree we have A035103, ones A014499, bits A035100.
Counting 1's instead of 0's (so restrict A000120 to A005117) gives A372433.
For binary length we have A372475, run-lengths A077643.
A030190 gives binary expansion, reversed A030308.
A048793 lists positions of ones in reversed binary expansion, sum A029931.
A371571 lists positions of zeros in binary expansion, sum A359359.
A371572 lists positions of ones in binary expansion, sum A230877.
A372515 lists positions of zeros in reversed binary expansion, sum A359400.
Cf. A003714, A039004, A049093, A049094, A059015, A069010, A070939, A073642, A145037, A211997, A368494, A372474, A372516.

A372583 := proc(n)
    A023416(A005117(n)) ;
end proc:
seq(A372583(n),n=1..200) ; # R. J. Mathar, May 20 2024

DigitCount[Select[Range[100],SquareFreeQ],2,0]

a(n) = A023416(A005117(n)).

a(n) + A372433(n) = A070939(A005117(n)) = A372475(n).

A372517 Least k such that the k-th prime number has exactly n ones in its binary expansion.

Original entry on oeis.org

1, 2, 4, 9, 11, 64, 31, 76, 167, 309, 502, 801, 1028, 7281, 6363, 12079, 12251, 43237, 43390, 146605, 291640, 1046198, 951351, 2063216, 3957778, 11134645, 14198321, 28186247, 54387475, 249939829, 105097565, 393248783, 751545789, 1391572698, 2182112798, 8242984130

Offset: 1

Gus Wiseman, May 12 2024

In other words, the a(n)-th prime is the least with binary weight n. The sorted version is A372686.

			The primes A000040(a(n)) together with their binary expansions and binary indices begin:
        2:                     10 ~ {2}
        3:                     11 ~ {1,2}
        7:                    111 ~ {1,2,3}
       23:                  10111 ~ {1,2,3,5}
       31:                  11111 ~ {1,2,3,4,5}
      311:              100110111 ~ {1,2,3,5,6,9}
      127:                1111111 ~ {1,2,3,4,5,6,7}
      383:              101111111 ~ {1,2,3,4,5,6,7,9}
      991:             1111011111 ~ {1,2,3,4,5,7,8,9,10}
     2039:            11111110111 ~ {1,2,3,5,6,7,8,9,10,11}
     3583:           110111111111 ~ {1,2,3,4,5,6,7,8,9,11,12}
     6143:          1011111111111 ~ {1,2,3,4,5,6,7,8,9,10,11,13}
     8191:          1111111111111 ~ {1,2,3,4,5,6,7,8,9,10,11,12,13}
    73727:      10001111111111111 ~ {1,2,3,4,5,6,7,8,9,10,11,12,13,17}
    63487:       1111011111111111 ~ {1,2,3,4,5,6,7,8,9,10,11,13,14,15,16}

Positions firsts of first appearances in A014499.
Taking primes gives A061712.
Counting zeros (weight) gives A372474, firsts of A035103.
For binary length we have A372684 (take primes A104080), firsts of A035100.
The sorted version is A372686, taking primes A372685.
A000120 counts ones in binary expansion (binary weight), zeros A080791.
A029837 gives greatest binary index, least A001511.
A030190 gives binary expansion, reversed A030308.
A048793 lists binary indices, reverse A272020, sum A029931.
A372471 lists binary indices of primes.
Cf. A000040, A066195, A069010, A070939, A071814, A211997, A372429, A372516.

spsm[y_]:=Max@@NestWhile[Most,y,Union[#]!=Range[Max@@#]&];
j=DigitCount[#,2,1]&/@Select[Range[1000],PrimeQ];
Table[Position[j,k][[1,1]],{k,spsm[j]}]

a(n) = my(k=1, p=2); while(hammingweight(p) !=n, p = nextprime(p+1); k++); k; \\ Michel Marcus, May 13 2024

from itertools import count
from sympy import isprime, primepi
from sympy.utilities.iterables import multiset_permutations
def A372517(n):
    for l in count(n-1):
        m = 1<Chai Wah Wu, May 13 2024

A000040(a(n)) = A061712(n).

a(32)-a(36) from Pontus von Brömssen, May 13 2024

A373126 Difference between 2^n and the greatest squarefree number <= 2^n.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1

Offset: 0

Gus Wiseman, May 29 2024

nonn

			The greatest squarefree number <= 2^21 is 2097149, and 2^21 = 2097152, so a(21) = 3.

For prime instead of squarefree we have A013603, opposite A092131.
For primes instead of powers of 2: A240474, A240473, A112926, A112925.
Difference between 2^n and A372889.
The opposite is A373125, delta of A372683.
A005117 lists squarefree numbers, first differences A076259.
A053797 gives lengths of gaps between squarefree numbers.
A061398 counts squarefree numbers between primes (exclusive).
A070939 or (preferably) A029837 gives length of binary expansion.
A077643 counts squarefree terms between powers of 2, run-lengths of A372475.
A143658 counts squarefree numbers up to 2^n.
Cf. A372473 (firsts of A372472), A372541 (firsts of A372433).
For primes between powers of 2:
- sum A293697 (except initial terms)
- length A036378
- min A104080 or A014210, indices A372684 (firsts of A035100)
- max A014234
Cf. A010036, A029931, A046933, A049093-A049096, A077641, A372540, A373197.

Table[2^n-NestWhile[#-1&,2^n,!SquareFreeQ[#]&],{n,0,100}]

a(n) = 2^n-A372889(n). - R. J. Mathar, May 31 2024

A373123 Sum of all squarefree numbers from 2^(n-1) to 2^n - 1.

Original entry on oeis.org

1, 5, 18, 63, 218, 891, 3676, 15137, 60580, 238672, 953501, 3826167, 15308186, 61204878, 244709252, 979285522, 3917052950, 15664274802, 62663847447, 250662444349, 1002632090376, 4010544455838, 16042042419476, 64168305037147, 256675237863576

Offset: 1

Gus Wiseman, May 27 2024

nonn

			This is the sequence of row sums of A005117 treated as a triangle with row-lengths A077643:
   1
   2   3
   5   6   7
  10  11  13  14  15
  17  19  21  22  23  26  29  30  31
  33  34  35  37  38  39  41  42  43  46  47  51  53  55  57  58  59  61  62

Counting all numbers (not just squarefree) gives A010036.
For the sectioning of A005117:
Row-lengths are A077643, partial sums A143658.
First column is A372683, delta A373125, indices A372540, firsts of A372475.
Last column is A372889, delta A373126, indices A143658, diffs A077643.
For primes instead of powers of two:
- sum A373197
- length A373198 = A061398 - 1
- maxima A112925, opposite A112926
For prime instead of squarefree:
- sum A293697 (except initial terms)
- length A036378
- min A104080 or A014210, indices A372684 (firsts of A035100)
- max A014234, delta A013603
A000120 counts ones in binary expansion (binary weight), zeros A080791.
A005117 lists squarefree numbers, first differences A076259.
A030190 gives binary expansion, reversed A030308.
A070939 or (preferably) A029837 gives length of binary expansion.
Cf. A372473 (firsts of A372472), A372541 (firsts of A372433).
Cf. A029931, A048793, A049093, A049094, A059015, A069010, A077641.

Table[Total[Select[Range[2^(n-1),2^n-1],SquareFreeQ]],{n,10}]

a(n) = my(s=0); forsquarefree(i=2^(n-1), 2^n-1, s+=i[1]); s; \\ Michel Marcus, May 29 2024

A372889 Greatest squarefree number <= 2^n.

Original entry on oeis.org

1, 2, 3, 7, 15, 31, 62, 127, 255, 511, 1023, 2047, 4094, 8191, 16383, 32767, 65535, 131071, 262142, 524287, 1048574, 2097149, 4194303, 8388607, 16777214, 33554431, 67108863, 134217727, 268435455, 536870911, 1073741822, 2147483647, 4294967295, 8589934591

Offset: 0

Gus Wiseman, May 27 2024

nonn

			The terms together with their binary expansions and binary indices begin:
      1:               1 ~ {1}
      2:              10 ~ {2}
      3:              11 ~ {1,2}
      7:             111 ~ {1,2,3}
     15:            1111 ~ {1,2,3,4}
     31:           11111 ~ {1,2,3,4,5}
     62:          111110 ~ {2,3,4,5,6}
    127:         1111111 ~ {1,2,3,4,5,6,7}
    255:        11111111 ~ {1,2,3,4,5,6,7,8}
    511:       111111111 ~ {1,2,3,4,5,6,7,8,9}
   1023:      1111111111 ~ {1,2,3,4,5,6,7,8,9,10}
   2047:     11111111111 ~ {1,2,3,4,5,6,7,8,9,10,11}
   4094:    111111111110 ~ {2,3,4,5,6,7,8,9,10,11,12}
   8191:   1111111111111 ~ {1,2,3,4,5,6,7,8,9,10,11,12,13}
  16383:  11111111111111 ~ {1,2,3,4,5,6,7,8,9,10,11,12,13,14}
  32767: 111111111111111 ~ {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}

Positions of these terms in A005117 are A143658.
For prime instead of squarefree we have A014234, delta A013603.
For primes instead of powers of two we have A112925, opposite A112926.
Least squarefree number >= 2^n is A372683, delta A373125, indices A372540.
The opposite for prime instead of squarefree is A372684, firsts of A035100.
The delta (difference from 2^n) is A373126.
A000120 counts ones in binary expansion (binary weight), zeros A080791.
A005117 lists squarefree numbers, first differences A076259.
A030190 gives binary expansion, reversed A030308, length A070939 or A029837.
A061398 counts squarefree numbers between primes, exclusive.
A077643 counts squarefree terms between powers of 2, run-lengths of A372475.
Cf. A029931, A048793, A049093, A049094, A077641, A372433, A372472, A372473, A372541, A373197, A373198.

Table[NestWhile[#-1&,2^n,!SquareFreeQ[#]&],{n,0,15}]

a(n) = my(k=2^n); while (!issquarefree(k), k--); k; \\ Michel Marcus, May 29 2024

a(n) = A005117(A143658(n)).

a(n) = A070321(2^n). - R. J. Mathar, May 31 2024

A372516 Number of ones minus number of zeros in the binary expansion of the n-th prime number.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, May 13 2024

sign

Absolute value is A177718.

			The binary expansion of 83 is (1,0,1,0,0,1,1), and 83 is the 23rd prime, so a(23) = 4 - 3 = 1.

The sum instead of difference is A035100, firsts A372684 (primes A104080).
The negative version is A037861(A000040(n)).
Restriction of A145037 to the primes.
The unsigned version is A177718.
- Positions of zeros are A177796, indices of the primes A066196.
- Positions of positive terms are indices of the primes A095070.
- Positions of negative terms are indices of the primes A095071.
- Positions of negative ones are A372539, indices of the primes A095072.
- Positions of ones are A372538, indices of the primes A095073.
- Positions of nonnegative terms are indices of the primes A095074.
- Positions of nonpositive terms are indices of the primes A095075.
A000120 counts ones in binary expansion (binary weight), zeros A080791.
A030190 gives binary expansion, reversed A030308.
A035103 counts zeros in binary expansion of primes, firsts A372474.
A048793 lists binary indices, reverse A272020, sum A029931.
A070939 gives length of binary expansion.
A101211 lists run-lengths in binary expansion, row-lengths A069010.
A372471 lists the binary indices of each prime.
Cf. A000043, A003714, A005940, A059305, A061712, A066195, A071814, A211997, A372429, A372517, A372686.

Table[DigitCount[Prime[n],2,1]-DigitCount[Prime[n],2,0],{n,100}]
DigitCount[#,2,1]-DigitCount[#,2,0]&/@Prime[Range[100]] (* Harvey P. Dale, May 09 2025 *)

a(n) = A000120(A000040(n)) - A080791(A000040(n)).
a(n) = A014499(n) - A035103(n).
a(n) = A145037(A000040(n))

A372688 Number of integer partitions y of n whose rank Sum_i 2^(y_i-1) is prime.

Original entry on oeis.org

0, 0, 2, 2, 1, 3, 3, 6, 3, 6, 9, 20, 13, 22, 22, 45, 47, 70, 75, 100, 107, 132, 157, 202, 229, 302, 396, 495, 536, 699, 820, 962, 1193, 1507, 1699, 2064, 2455, 2945, 3408, 4026, 4691, 5749, 6670, 7614, 9127, 10930, 12329, 14370, 16955, 19961, 22950, 26574, 30941

Offset: 0

Gus Wiseman, May 16 2024

nonn

Note the function taking a set s to Sum_i 2^(s_i-1) is the inverse of A048793 (binary indices).

			The partition (3,2,1) has rank 2^(3-1) + 2^(2-1) + 2^(1-1) = 7, which is prime, so (3,2,1) is counted under a(6).
The a(2) = 2 through a(10) = 9 partitions:
(2)   (21)   (31)  (221)    (51)    (421)      (431)   (441)     (91)
(11)  (111)        (2111)   (321)   (2221)     (521)   (3321)    (631)
                   (11111)  (3111)  (4111)     (5111)  (4221)    (721)
                                    (22111)            (33111)   (3331)
                                    (211111)           (42111)   (7111)
                                    (1111111)          (411111)  (32221)
                                                                 (322111)
                                                                 (3211111)
                                                                 (31111111)

For all positive integers (not just prime) we get A000041.
For even instead of prime we have A087787, strict A025147, odd A096765.
These partitions have Heinz numbers A277319.
The strict case is A372687, ranks A372851.
The version counting only distinct parts is A372887, ranks A372850.
A014499 lists binary indices of prime numbers.
A019565 gives Heinz number of binary indices, adjoint A048675.
A048793 and A272020 (reverse) list binary indices:
- length A000120
- min A001511
- sum A029931
- max A070939
A058698 counts partitions of prime numbers, strict A064688.
A372885 lists primes whose binary indices sum to a prime, indices A372886.
Cf. A000040, A005940, A023506, A029837, A035100, A038499, A096111, A372429, A372441, A372471, A372689.

Table[Length[Select[IntegerPartitions[n], PrimeQ[Total[2^#]/2]&]],{n,0,30}]

A372689 Positive integers whose binary indices (positions of ones in reversed binary expansion) sum to a prime number.

Original entry on oeis.org

2, 3, 4, 6, 9, 11, 12, 16, 18, 23, 26, 29, 33, 38, 41, 43, 44, 48, 50, 55, 58, 61, 64, 69, 71, 72, 74, 79, 81, 86, 89, 91, 92, 96, 101, 103, 104, 106, 111, 113, 118, 121, 131, 132, 134, 137, 142, 144, 149, 151, 152, 154, 159, 163, 164, 166, 169, 174, 176, 181

Offset: 1

Gus Wiseman, May 18 2024

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

Note the function taking a set s to its binary rank Sum_i 2^(s_i-1) is the inverse of A048793 (binary indices).

			The terms together with their binary expansions and binary indices begin:
   2:      10 ~ {2}
   3:      11 ~ {1,2}
   4:     100 ~ {3}
   6:     110 ~ {2,3}
   9:    1001 ~ {1,4}
  11:    1011 ~ {1,2,4}
  12:    1100 ~ {3,4}
  16:   10000 ~ {5}
  18:   10010 ~ {2,5}
  23:   10111 ~ {1,2,3,5}
  26:   11010 ~ {2,4,5}
  29:   11101 ~ {1,3,4,5}
  33:  100001 ~ {1,6}
  38:  100110 ~ {2,3,6}
  41:  101001 ~ {1,4,6}
  43:  101011 ~ {1,2,4,6}
  44:  101100 ~ {3,4,6}
  48:  110000 ~ {5,6}
  50:  110010 ~ {2,5,6}
  55:  110111 ~ {1,2,3,5,6}
  58:  111010 ~ {2,4,5,6}
  61:  111101 ~ {1,3,4,5,6}

Numbers k such that A029931(k) is prime.
Union of prime-indexed rows of A118462.
For even instead of prime we have A158704, odd A158705.
For prime indices instead of binary indices we have A316091.
The prime case is A372885, indices A372886.
A000040 lists the prime numbers, A014499 their binary indices.
A019565 gives Heinz number of binary indices, adjoint A048675.
A058698 counts partitions of prime numbers, strict A064688.
A372471 lists binary indices of primes, row-sums A372429.
A372687 counts strict partitions of prime binary rank, counted by A372851.
A372689 lists numbers whose binary indices sum to a prime.
A372885 lists primes whose binary indices sum to a prime, indices A372886.
Binary indices:
- listed A048793, sum A029931
- reversed A272020
- opposite A371572, sum A230877
- length A000120, complement A023416
- min A001511, opposite A000012
- max A070939, opposite A070940
- complement A368494, sum A359400
- opposite complement A371571, sum A359359
Cf. A035100, A071814, A096111, A023506, A277319, A372688, A372850, A372887.

Select[Range[100],PrimeQ[Total[First /@ Position[Reverse[IntegerDigits[#,2]],1]]]&]

A372885 Prime numbers whose binary indices (positions of ones in reversed binary expansion) sum to another prime number.

Original entry on oeis.org

2, 3, 11, 23, 29, 41, 43, 61, 71, 79, 89, 101, 103, 113, 131, 137, 149, 151, 163, 181, 191, 197, 211, 239, 269, 271, 281, 293, 307, 331, 349, 353, 373, 383, 401, 433, 457, 491, 503, 509, 523, 541, 547, 593, 641, 683, 701, 709, 743, 751, 761, 773, 827, 863, 887

Offset: 1

Gus Wiseman, May 19 2024

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

The indices of these primes are A372886.

			The binary indices of 89 are {1,4,5,7}, with sum 17, which is prime, so 89 is in the sequence.
The terms together with their binary expansions and binary indices begin:
    2:         10 ~ {2}
    3:         11 ~ {1,2}
   11:       1011 ~ {1,2,4}
   23:      10111 ~ {1,2,3,5}
   29:      11101 ~ {1,3,4,5}
   41:     101001 ~ {1,4,6}
   43:     101011 ~ {1,2,4,6}
   61:     111101 ~ {1,3,4,5,6}
   71:    1000111 ~ {1,2,3,7}
   79:    1001111 ~ {1,2,3,4,7}
   89:    1011001 ~ {1,4,5,7}
  101:    1100101 ~ {1,3,6,7}
  103:    1100111 ~ {1,2,3,6,7}
  113:    1110001 ~ {1,5,6,7}
  131:   10000011 ~ {1,2,8}
  137:   10001001 ~ {1,4,8}
  149:   10010101 ~ {1,3,5,8}
  151:   10010111 ~ {1,2,3,5,8}
  163:   10100011 ~ {1,2,6,8}
  181:   10110101 ~ {1,3,5,6,8}
  191:   10111111 ~ {1,2,3,4,5,6,8}
  197:   11000101 ~ {1,3,7,8}

Robert Israel, Table of n, a(n) for n = 1..10000

For prime instead of binary indices we have A006450, prime case of A316091.
Prime numbers p such that A029931(p) is also prime.
Prime case of A372689.
The indices of these primes are A372886.
A000040 lists the prime numbers, A014499 their binary indices.
A019565 gives Heinz number of binary indices, adjoint A048675.
A058698 counts partitions of prime numbers, strict A064688.
A372687 counts strict partitions of prime binary rank, counted by A372851.
A372688 counts partitions of prime binary rank, with Heinz numbers A277319.
Binary indices:
- listed A048793, sum A029931
- reversed A272020
- opposite A371572, sum A230877
- length A000120, complement A023416
- min A001511, opposite A000012
- max A070939, opposite A070940
- complement A368494, sum A359400
- opposite complement A371571, sum A359359
Cf. A000009, A029837, A035100, A038499, A096111, A372429, A372441, A372471, A372850, A372887.

filter:= proc(p)
  local L,i,t;
  L:= convert(p,base,2);
  isprime(add(i*L[i],i=1..nops(L)))
end proc:
select(filter, [seq(ithprime(i),i=1..200)]); # Robert Israel, Jun 19 2025

Select[Range[100],PrimeQ[#] && PrimeQ[Total[First/@Position[Reverse[IntegerDigits[#,2]],1]]]&]

A372886 Indices of prime numbers whose binary indices (positions of ones in reversed binary expansion) sum to another prime number.

Original entry on oeis.org

1, 2, 5, 9, 10, 13, 14, 18, 20, 22, 24, 26, 27, 30, 32, 33, 35, 36, 38, 42, 43, 45, 47, 52, 57, 58, 60, 62, 63, 67, 70, 71, 74, 76, 79, 84, 88, 94, 96, 97, 99, 100, 101, 108, 116, 124, 126, 127, 132, 133, 135, 137, 144, 150, 154, 156, 160, 161, 162, 164, 172

Offset: 1

Gus Wiseman, May 19 2024

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.

The prime numbers themselves are A372885(n).

			The binary indices of 89 = prime(24) are {1,4,5,7}, with sum 17, which is prime, so 24 is in the sequence.

Robert Israel, Table of n, a(n) for n = 1..10000

Numbers k such that A029931(prime(k)) is prime.
Indices of primes that belong to A372689.
The indexed prime numbers themselves are A372885.
A000040 lists the prime numbers, A014499 their binary indices
A006450 lists primes of prime index, prime case of A316091.
A019565 gives Heinz number of binary indices, adjoint A048675.
A038499 counts partitions of prime length, strict A085756.
Binary indices:
- listed A048793, sum A029931
- reversed A272020
- opposite A371572, sum A230877
- length A000120, complement A023416
- min A001511, opposite A000012
- max A070939, opposite A070940
- complement A368494, sum A359400
- opposite complement A371571, sum A359359
A058698 counts partitions of prime numbers, strict A064688.
A372687 counts strict partitions of prime binary rank, counted by A372851.
A372688 counts partitions of prime binary rank, with Heinz numbers A277319.
Cf. A029837, A158704, A158705, A035100, A372429, A372471, A372850.

filter:= proc(p)
  local L,i,t;
  L:= convert(p,base,2);
  isprime(add(i*L[i],i=1..nops(L)))
end proc:
select(t -> filter(ithprime(t)), [$1..1000]); # Robert Israel, Jun 19 2025

Select[Range[100],PrimeQ[Total[First /@ Position[Reverse[IntegerDigits[Prime[#],2]],1]]]&]

cp's OEIS Frontend

A372472 Number of zeros in the binary expansion of the n-th squarefree number.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

Formula

A372517 Least k such that the k-th prime number has exactly n ones in its binary expansion.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A373126 Difference between 2^n and the greatest squarefree number <= 2^n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A373123 Sum of all squarefree numbers from 2^(n-1) to 2^n - 1.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

PARI

A372889 Greatest squarefree number <= 2^n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A372516 Number of ones minus number of zeros in the binary expansion of the n-th prime number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A372688 Number of integer partitions y of n whose rank Sum_i 2^(y_i-1) is prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A372689 Positive integers whose binary indices (positions of ones in reversed binary expansion) sum to a prime number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica