|
|
A357215
|
|
a(n) = number of nonempty subsets S of {1, 2, ..., n} that contain only primes.
|
|
2
|
|
|
0, 1, 3, 3, 7, 7, 15, 15, 15, 15, 31, 31, 63, 63, 63, 63, 127, 127, 255, 255, 255, 255, 511, 511, 511, 511, 511, 511, 1023, 1023, 2047, 2047, 2047, 2047, 2047, 2047, 4095, 4095, 4095, 4095, 8191, 8191, 16383, 16383, 16383, 16383, 32767, 32767, 32767, 32767
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The nonempty subsets S of {1, 2, 3, 4} that contain only primes are these: {2}, {3}, {2,3}, thus, a(4) = 3.
|
|
MATHEMATICA
|
Table[-1 + 2^PrimePi[n], {n, 1, 70}]
|
|
PROG
|
(Python)
from sympy import primepi
def a(n): return 2**primepi(n) - 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|