Sequences
392,541 sequences
- Number of 8k+5 primes (A007521) in range ]2^n,2^(n+1)].A095011
Number of 8k+5 primes (A007521) in range ]2^n,2^(n+1)].
- Number of 8k+7 primes (A007522) in range ]2^n,2^(n+1)].A095012
Number of 8k+7 primes (A007522) in range ]2^n,2^(n+1)].
- Number of 8k+-1 primes (A001132) in range [2^n,2^(n+1)].A095013
Number of 8k+-1 primes (A001132) in range [2^n,2^(n+1)].
- Number of 8k+-3 primes (A003629) in range [2^n,2^(n+1)].A095014
Number of 8k+-3 primes (A003629) in range [2^n,2^(n+1)].
- Number of 6k+1 primes (A002476) in range ]2^n,2^(n+1)].A095015
Number of 6k+1 primes (A002476) in range ]2^n,2^(n+1)].
- Number of 6k+5 primes (A007528) in range [2^n,2^(n+1)].A095016
Number of 6k+5 primes (A007528) in range [2^n,2^(n+1)].
- Number of lesser twin primes (A001359) in range ]2^n, 2^(n+1)].A095017
Number of lesser twin primes (A001359) in range ]2^n, 2^(n+1)].
- a(n) is the number of primes p which have exactly n zeros and n ones when written in binary.A095018
a(n) is the number of primes p which have exactly n zeros and n ones when written in binary.
- Number of zero-bit dominant primes (A095071) in range ]2^n,2^(n+1)].A095019
Number of zero-bit dominant primes (A095071) in range ]2^n,2^(n+1)].
- Number of one-bit dominant primes (A095070) in range ]2^n,2^(n+1)].A095020
Number of one-bit dominant primes (A095070) in range ]2^n,2^(n+1)].
- Number of 5k+1 primes (A030430) in range [2^n,2^(n+1)].A095021
Number of 5k+1 primes (A030430) in range [2^n,2^(n+1)].
- Number of 5k+2 primes (A030432) in range [2^n,2^(n+1)].A095022
Number of 5k+2 primes (A030432) in range [2^n,2^(n+1)].
- Number of 5k+3 primes (A030431) in range ]2^n,2^(n+1)].A095023
Number of 5k+3 primes (A030431) in range ]2^n,2^(n+1)].
- Number of 5k+4 primes (A030433) in range ]2^n,2^(n+1)].A095024
Number of 5k+4 primes (A030433) in range ]2^n,2^(n+1)].
- Number of inequivalent cyclic difference sets with n elements.A095025
Number of inequivalent cyclic difference sets with n elements.
- Lower triangle T(j,k) read by rows, where T(j,k) is the number of occurrences of the digit k-1 as least significant digit in the base-j multiplication table.A095026
Lower triangle T(j,k) read by rows, where T(j,k) is the number of occurrences of the digit k-1 as least significant digit in the base-j multiplication table.
- Semiprimes of the form 3^n - 2^n.A095027
Semiprimes of the form 3^n - 2^n.
- An example of a (v,k,lambda)=(11,5,2) cyclic difference set.A095028
An example of a (v,k,lambda)=(11,5,2) cyclic difference set.
- An example of a (v,k,lambda)=(21,5,1) cyclic difference set.A095029
An example of a (v,k,lambda)=(21,5,1) cyclic difference set.
- An example of a (v,k,lambda)=(31,6,1) cyclic difference set.A095030
An example of a (v,k,lambda)=(31,6,1) cyclic difference set.
- An example of a (v,k,lambda)=(15,7,3) cyclic difference set.A095031
An example of a (v,k,lambda)=(15,7,3) cyclic difference set.
- An example of a (v,k,lambda)=(57,8,1) cyclic difference set.A095032
An example of a (v,k,lambda)=(57,8,1) cyclic difference set.
- An example of a (v,k,lambda)=(19,9,4) cyclic difference set.A095033
An example of a (v,k,lambda)=(19,9,4) cyclic difference set.
- An example of a (v,k,lambda)=(37,9,2) cyclic difference set.A095034
An example of a (v,k,lambda)=(37,9,2) cyclic difference set.
- An example of a (v,k,lambda)=(73,9,1) cyclic difference set.A095035
An example of a (v,k,lambda)=(73,9,1) cyclic difference set.
- An example of a (v,k,lambda)=(91,10,1) cyclic difference set.A095036
An example of a (v,k,lambda)=(91,10,1) cyclic difference set.
- An example of a (v,k,lambda)=(23,11,5) cyclic difference set.A095037
An example of a (v,k,lambda)=(23,11,5) cyclic difference set.
- An example of a (v,k,lambda)=(133,12,1) cyclic difference set.A095038
An example of a (v,k,lambda)=(133,12,1) cyclic difference set.
- An example of a (v,k,lambda)=(40,13,4) cyclic difference set.A095039
An example of a (v,k,lambda)=(40,13,4) cyclic difference set.
- An example of a (v,k,lambda)=(183,14,1) cyclic difference set.A095040
An example of a (v,k,lambda)=(183,14,1) cyclic difference set.
- One of two (v,k,lambda)=(31,15,7) cyclic difference sets. The other one is A095042.A095041
One of two (v,k,lambda)=(31,15,7) cyclic difference sets. The other one is A095042.
- One of two (v,k,lambda)=(31,15,7) cyclic difference sets. The other one is A095041.A095042
One of two (v,k,lambda)=(31,15,7) cyclic difference sets. The other one is A095041.
- An example of a (v,k,lambda)=(35,17,8) cyclic difference set.A095043
An example of a (v,k,lambda)=(35,17,8) cyclic difference set.
- An example of a (v,k,lambda)=(273,17,1) cyclic difference set.A095044
An example of a (v,k,lambda)=(273,17,1) cyclic difference set.
- An example of a (v,k,lambda)=(307,18,1) cyclic difference set.A095045
An example of a (v,k,lambda)=(307,18,1) cyclic difference set.
- An example of a (v,k,lambda)=(381,20,1) cyclic difference set.A095046
An example of a (v,k,lambda)=(381,20,1) cyclic difference set.
- An example of a (v,k,lambda)=(107,53,26) cyclic difference set.A095047
An example of a (v,k,lambda)=(107,53,26) cyclic difference set.
- Number of distinct digits needed to write all positive divisors of n in decimal representation.A095048
Number of distinct digits needed to write all positive divisors of n in decimal representation.
- Number of distinct digits needed to write in decimal representation all positive non-divisors of n that are less than n.A095049
Number of distinct digits needed to write in decimal representation all positive non-divisors of n that are less than n.
- Numbers such that all ten digits are needed to write all positive divisors in decimal representation.A095050
Numbers such that all ten digits are needed to write all positive divisors in decimal representation.
- E.g.f.: exp(-x)/eta(x), where eta(x) is the Dedekind eta function.A095051
E.g.f.: exp(-x)/eta(x), where eta(x) is the Dedekind eta function.
- Number of primes with number of 0-bits equal to one plus number of 1-bits (A095072) in range ]2^2n,2^(2n+1)].A095052
Number of primes with number of 0-bits equal to one plus number of 1-bits (A095072) in range ]2^2n,2^(2n+1)].
- Number of primes with number of 1-bits equal to one plus number 0-bits (A095073) in range ]2^2n,2^(2n+1)].A095053
Number of primes with number of 1-bits equal to one plus number 0-bits (A095073) in range ]2^2n,2^(2n+1)].
- Number of primes with number of 0-bits <= number of 1-bits (A095074) in range ]2^n,2^(n+1)].A095054
Number of primes with number of 0-bits <= number of 1-bits (A095074) in range ]2^n,2^(n+1)].
- Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)].A095055
Number of primes with number of 1-bits <= number of 0-bits (A095075) in range ]2^n,2^(n+1)].
- Number of primes with three 1-bits (A081091) in range [2^n,2^(n+1)].A095056
Number of primes with three 1-bits (A081091) in range [2^n,2^(n+1)].
- Number of primes with four 1-bits (A095077) in range ]2^n,2^(n+1)].A095057
Number of primes with four 1-bits (A095077) in range ]2^n,2^(n+1)].
- Number of primes with a single 0-bit (A095078) in range ]2^n,2^(n+1)].A095058
Number of primes with a single 0-bit (A095078) in range ]2^n,2^(n+1)].
- Number of primes with two 0-bits (A095079) in range ]2^n,2^(n+1)].A095059
Number of primes with two 0-bits (A095079) in range ]2^n,2^(n+1)].
- Number of fibeven primes (A095080) in range ]2^n,2^(n+1)].A095060
Number of fibeven primes (A095080) in range ]2^n,2^(n+1)].