Sequences
392,541 sequences
- Least positive residues [mod 210] representing those residue classes which can be smaller prime of a difference 6 taken from A031924.A078861
Least positive residues [mod 210] representing those residue classes which can be smaller prime of a difference 6 taken from A031924.
- Smallest primes from A031924, each belonging to those different residue class of mod 210 which are listed in A078861. Arranged according to possible least positive residues mod 210.A078862
Smallest primes from A031924, each belonging to those different residue class of mod 210 which are listed in A078861. Arranged according to possible least positive residues mod 210.
- Smallest primes from A029710, each belonging to those different residue class of mod 210 which are listed in A078860. Arranged according to possible least positive residues mod 210.A078863
Smallest primes from A029710, each belonging to those different residue class of mod 210 which are listed in A078860. Arranged according to possible least positive residues mod 210.
- Smallest primes from A001359, each belonging to those different residue class of mod 210 which are listed in A078859. Arranged according to possible least positive residues mod 210.A078864
Smallest primes from A001359, each belonging to those different residue class of mod 210 which are listed in A078859. Arranged according to possible least positive residues mod 210.
- Difference of consecutive primorial numbers divided by 4.A078865
Difference of consecutive primorial numbers divided by 4.
- The quadruples (d1,d2,d3,d4) with elements in {2,4,6} are listed in lexicographic order; for each quadruple, this sequence lists the smallest prime p >= 5 such that the differences between the 5 consecutive primes starting with p are (d1,d2,d3,d4), if such a prime exists.A078866
The quadruples (d1,d2,d3,d4) with elements in {2,4,6} are listed in lexicographic order; for each quadruple, this sequence lists the smallest prime p >= 5 such that the differences between the 5 consecutive primes starting with p are (d1,d2,d3,d4), if such a prime exists.
- Sorted version of A078866.A078867
Sorted version of A078866.
- Decimal concatenations of the quadruples (d1,d2,d3,d4) with elements in {2,4,6} for which there exists a prime p >= 5 such that the differences between the 5 consecutive primes starting with p are (d1,d2,d3,d4).A078868
Decimal concatenations of the quadruples (d1,d2,d3,d4) with elements in {2,4,6} for which there exists a prime p >= 5 such that the differences between the 5 consecutive primes starting with p are (d1,d2,d3,d4).
- Number of n-tuples with elements in {2,4,6} which can occur as the differences between n+1 consecutive primes > n+1. (Values of a(11), ..., a(18) are conjectured to be correct, but are only known to be upper bounds.)A078869
Number of n-tuples with elements in {2,4,6} which can occur as the differences between n+1 consecutive primes > n+1. (Values of a(11), ..., a(18) are conjectured to be correct, but are only known to be upper bounds.)
- Decimal concatenations of the 38 quintuples (d1,d2,d3,d4,d5) with elements in {2,4,6} for which there exists a prime p >= 7 such that the differences between the 6 consecutive primes starting with p are (d1,d2,d3,d4,d5).A078870
Decimal concatenations of the 38 quintuples (d1,d2,d3,d4,d5) with elements in {2,4,6} for which there exists a prime p >= 7 such that the differences between the 6 consecutive primes starting with p are (d1,d2,d3,d4,d5).
- Decimal concatenations of the 6-tuples (d1,d2,d3,d4,d5,d6) with elements in {2,4,6} for which there exists a prime p >= 7 such that the differences between the 7 consecutive primes starting with p are (d1,d2,d3,d4,d5,d6).A078871
Decimal concatenations of the 6-tuples (d1,d2,d3,d4,d5,d6) with elements in {2,4,6} for which there exists a prime p >= 7 such that the differences between the 7 consecutive primes starting with p are (d1,d2,d3,d4,d5,d6).
- The quintuples (d1,d2,d3,d4,d5) with elements in {2,4,6} are listed in lexicographic order; for each quintuple, this sequence lists the smallest prime p >= 7 such that the differences between the 6 consecutive primes starting with p are (d1,d2,d3,d4,d5), if such a prime exists.A078872
The quintuples (d1,d2,d3,d4,d5) with elements in {2,4,6} are listed in lexicographic order; for each quintuple, this sequence lists the smallest prime p >= 7 such that the differences between the 6 consecutive primes starting with p are (d1,d2,d3,d4,d5), if such a prime exists.
- Sorted version of A078872.A078873
Sorted version of A078872.
- The 6-tuples (d1,d2,d3,d4,d5,d6) with elements in {2,4,6} are listed in lexicographic order; for each 6-tuple, this sequence lists the smallest prime p >= 7 such that the differences between the 7 consecutive primes starting with p are (d1,d2,d3,d4,d5,d6), if such a prime exists.A078874
The 6-tuples (d1,d2,d3,d4,d5,d6) with elements in {2,4,6} are listed in lexicographic order; for each 6-tuple, this sequence lists the smallest prime p >= 7 such that the differences between the 7 consecutive primes starting with p are (d1,d2,d3,d4,d5,d6), if such a prime exists.
- Sorted version of A078874.A078875
Sorted version of A078874.
- a(n) = n^4*(n^4-1)/240.A078876
a(n) = n^4*(n^4-1)/240.
- Nonprimes in A078447.A078877
Nonprimes in A078447.
- Irreducible polynomial coefficient of singular value associated with sqrt(2n).A078878
Irreducible polynomial coefficient of singular value associated with sqrt(2n).
- Triangle read by rows: T(n,k) = ceiling(k^2 / n), 0 < k < n and T(n,n) = 0.A078879
Triangle read by rows: T(n,k) = ceiling(k^2 / n), 0 < k < n and T(n,n) = 0.
- The sequence starting with 2 that equals its own run length sequence.A078880
The sequence starting with 2 that equals its own run length sequence.
- Size of the largest subset S of {1,2,3,...,n} with the property that if i and j are distinct elements of S then i XOR j is not in S, where XOR is the bitwise exclusive-OR operator.A078881
Size of the largest subset S of {1,2,3,...,n} with the property that if i and j are distinct elements of S then i XOR j is not in S, where XOR is the bitwise exclusive-OR operator.
- Number of subsets S of {1,2,3,...,n} with the largest possible cardinality consistent with the requirement that if i and j are distinct elements of S then i XOR j is not in S. XOR is the bitwise exclusive-OR operator.A078882
Number of subsets S of {1,2,3,...,n} with the largest possible cardinality consistent with the requirement that if i and j are distinct elements of S then i XOR j is not in S. XOR is the bitwise exclusive-OR operator.
- Lesser member p of a twin prime pair such that p+1 is 3-smooth.A078883
Lesser member p of a twin prime pair such that p+1 is 3-smooth.
- Greater member p of a twin prime pair such that p-1 is 3-smooth.A078884
Greater member p of a twin prime pair such that p-1 is 3-smooth.
- Decimal expansion of Sum {n>=0} 1/3^(2^n).A078885
Decimal expansion of Sum {n>=0} 1/3^(2^n).
- Decimal expansion of Sum {n>=0} 1/5^(2^n).A078886
Decimal expansion of Sum {n>=0} 1/5^(2^n).
- Decimal expansion of Sum {n>=0} 1/6^(2^n).A078887
Decimal expansion of Sum {n>=0} 1/6^(2^n).
- Decimal expansion of Sum {n>=0} 1/7^(2^n).A078888
Decimal expansion of Sum {n>=0} 1/7^(2^n).
- Decimal expansion of Sum {n>=0} 1/8^(2^n).A078889
Decimal expansion of Sum {n>=0} 1/8^(2^n).
- Decimal expansion of Sum {n>=0} 1/9^(2^n).A078890
Decimal expansion of Sum {n>=0} 1/9^(2^n).
- Concatenate first n triangular numbers in reverse order.A078891
Concatenate first n triangular numbers in reverse order.
- Numbers n such that phi(n) - 1 is prime, where phi is Euler's totient function (A000010).A078892
Numbers n such that phi(n) - 1 is prime, where phi is Euler's totient function (A000010).
- Composite numbers k such that phi(k) - 1 is prime, where phi is Euler's totient function (A000010).A078893
Composite numbers k such that phi(k) - 1 is prime, where phi is Euler's totient function (A000010).
- Start with a list of all the primes and repeatedly add the first element A of the list to the sequence and strike off every A-th element of the list.A078894
Start with a list of all the primes and repeatedly add the first element A of the list to the sequence and strike off every A-th element of the list.
- Palindromes which are a nontrivial product of 3 palindromes (which need not be distinct).A078895
Palindromes which are a nontrivial product of 3 palindromes (which need not be distinct).
- Number of times the smallest prime factor of n is a factor in all numbers <= n; a(1) = 1.A078896
Number of times the smallest prime factor of n is a factor in all numbers <= n; a(1) = 1.
- Number of times the greatest prime factor of n is a factor in all numbers <=n; a(1)=1.A078897
Number of times the greatest prime factor of n is a factor in all numbers <=n; a(1)=1.
- Number of times the smallest prime factor of n is the smallest prime factor for numbers <= n; a(0)=0, a(1)=1.A078898
Number of times the smallest prime factor of n is the smallest prime factor for numbers <= n; a(0)=0, a(1)=1.
- Number of times the greatest prime factor of n is the greatest prime factor for numbers <=n; a(1)=1.A078899
Number of times the greatest prime factor of n is the greatest prime factor for numbers <=n; a(1)=1.
- Generalized Fermat numbers of the form (k+1)^2^m + k^2^m, with m>0.A078900
Generalized Fermat numbers of the form (k+1)^2^m + k^2^m, with m>0.
- Generalized Fermat numbers of the form (k+1)^2^m + k^2^m, with m>1.A078901
Generalized Fermat numbers of the form (k+1)^2^m + k^2^m, with m>1.
- Generalized Fermat primes of the form (k+1)^2^m + k^2^m, with m>1.A078902
Generalized Fermat primes of the form (k+1)^2^m + k^2^m, with m>1.
- a(n) = n^2 - Sum_{u=1..n} Sum_{v=1..u} valuation(2*v, 2).A078903
a(n) = n^2 - Sum_{u=1..n} Sum_{v=1..u} valuation(2*v, 2).
- a(n) = 4a(n-1) + 3n with a(0) = 0.A078904
a(n) = 4a(n-1) + 3n with a(0) = 0.
- The q expansion of Lambda^5, a Hauptmodul for Gamma_1(5).A078905
The q expansion of Lambda^5, a Hauptmodul for Gamma_1(5).
- Expansion of j in powers of Gamma(5)-modular function Lambda^5.A078906
Expansion of j in powers of Gamma(5)-modular function Lambda^5.
- Expansion of modular function j/256 in powers of m=k^2=lambda(t).A078907
Expansion of modular function j/256 in powers of m=k^2=lambda(t).
- Let r+i*s be the sum, with multiplicity, of the first-quadrant Gaussian primes dividing n; sequence gives r values (with a(1) = 0).A078908
Let r+i*s be the sum, with multiplicity, of the first-quadrant Gaussian primes dividing n; sequence gives r values (with a(1) = 0).
- Let r+i*s be the sum, with multiplicity, of the first-quadrant Gaussian primes dividing n; sequence gives s values.A078909
Let r+i*s be the sum, with multiplicity, of the first-quadrant Gaussian primes dividing n; sequence gives s values.
- Let r+i*s be the sum of the distinct first-quadrant Gaussian integers dividing n; sequence gives r values.A078910
Let r+i*s be the sum of the distinct first-quadrant Gaussian integers dividing n; sequence gives r values.