Sequences
392,541 sequences
- Coordination sequence T4 for Zeolite Code ISV.A047961
Coordination sequence T4 for Zeolite Code ISV.
- Coordination sequence T5 for Zeolite Code ISV.A047962
Coordination sequence T5 for Zeolite Code ISV.
- Coordination sequence T1 for Zeolite Code MSO.A047963
Coordination sequence T1 for Zeolite Code MSO.
- Coordination sequence T2 for Zeolite Code MSO.A047964
Coordination sequence T2 for Zeolite Code MSO.
- Coordination sequence T3 for Zeolite Code MSO.A047965
Coordination sequence T3 for Zeolite Code MSO.
- a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts.A047966
a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts.
- Number of partitions of n with some part repeated.A047967
Number of partitions of n with some part repeated.
- a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d.A047968
a(n) = Sum_{d|n} p(d), where p(d) = A000041 = number of partitions of d.
- Square array of nexus numbers a(n,k) = (n+1)^(k+1) - n^(k+1) (n >= 0, k >= 0) read by upwards antidiagonals.A047969
Square array of nexus numbers a(n,k) = (n+1)^(k+1) - n^(k+1) (n >= 0, k >= 0) read by upwards antidiagonals.
- Antidiagonal sums of nexus numbers (A047969).A047970
Antidiagonal sums of nexus numbers (A047969).
- Triangle of coefficients of Gaussian polynomials [ n+3,3 ].A047971
Triangle of coefficients of Gaussian polynomials [ n+3,3 ].
- Distance of n-th prime to nearest square.A047972
Distance of n-th prime to nearest square.
- Distance of n-th prime to nearest cube.A047973
Distance of n-th prime to nearest cube.
- a(n) = a(n-1) + 2*(n-1)*a(n-2).A047974
a(n) = a(n-1) + 2*(n-1)*a(n-2).
- Let (p1,p2), (p3,p4) be two pairs of successive primes such that p1*p2=p3+p4-1, |p2-p1|=|p4-p3|; sequence gives |p2-p1|=|p4-p3|.A047975
Let (p1,p2), (p3,p4) be two pairs of successive primes such that p1*p2=p3+p4-1, |p2-p1|=|p4-p3|; sequence gives |p2-p1|=|p4-p3|.
- Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p1.A047976
Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p1.
- Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p2.A047977
Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p2.
- Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p3.A047978
Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p3.
- Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p4.A047979
Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p4.
- a(n) is smallest difference d of an arithmetic progression dk+1 whose first prime occurs at the n-th position.A047980
a(n) is smallest difference d of an arithmetic progression dk+1 whose first prime occurs at the n-th position.
- a(n) = A047980(2n).A047981
a(n) = A047980(2n).
- a(n) = A047980(2n+1).A047982
a(n) = A047980(2n+1).
- Number of integers less than n but with the same number of divisors.A047983
Number of integers less than n but with the same number of divisors.
- Integers n such that A047988(n)=1.A047984
Integers n such that A047988(n)=1.
- Integers n such that A047988(n)=2.A047985
Integers n such that A047988(n)=2.
- Integers n such that A047988(n)=3.A047986
Integers n such that A047988(n)=3.
- Integers n such that A047988(n)=4.A047987
Integers n such that A047988(n)=4.
- Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding or subtracting 1. The division steps are free, but adding or subtracting 1 costs 1 point. a(n) is the smallest cost to reach 2.A047988
Start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding or subtracting 1. The division steps are free, but adding or subtracting 1 costs 1 point. a(n) is the smallest cost to reach 2.
- 6 consecutive primes p such that each 2p+1 is also prime.A047989
6 consecutive primes p such that each 2p+1 is also prime.
- a(n+1) = a(n) + (n^2 + 1)*a(n-1).A047990
a(n+1) = a(n) + (n^2 + 1)*a(n-1).
- Triangle formed from expansion of (x-1)*(x+2)*(x-3)*...*(x+-n).A047991
Triangle formed from expansion of (x-1)*(x+2)*(x-3)*...*(x+-n).
- Number of distinct permutations generated by shuffling n cards with "clump size" <= 2.A047992
Number of distinct permutations generated by shuffling n cards with "clump size" <= 2.
- Number of balanced partitions of n: the largest part equals the number of parts.A047993
Number of balanced partitions of n: the largest part equals the number of parts.
- Unitary totient (or unitary phi) function uphi(n).A047994
Unitary totient (or unitary phi) function uphi(n).
- Number of impartial misere games born on or before day n.A047995
Number of impartial misere games born on or before day n.
- Triangle read by rows: T(n,k) is the (n,k)-th circular binomial coefficient, where 0 <= k <= n.A047996
Triangle read by rows: T(n,k) is the (n,k)-th circular binomial coefficient, where 0 <= k <= n.
- Triangle of numbers a(n,k) = number of balance positions when k equal weights are placed at a k-subset of the points {-n, -(n-1), ..., n-1, n} on a centrally pivoted rod.A047997
Triangle of numbers a(n,k) = number of balance positions when k equal weights are placed at a k-subset of the points {-n, -(n-1), ..., n-1, n} on a centrally pivoted rod.
- Triangle of numbers a(n,k) = number of "fountains" with n coins, k in the bottom row.A047998
Triangle of numbers a(n,k) = number of "fountains" with n coins, k in the bottom row.
- Sierpiński's [Sierpinski's] triangle (or gasket): triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 2.A047999
Sierpiński's [Sierpinski's] triangle (or gasket): triangle, read by rows, formed by reading Pascal's triangle (A007318) mod 2.
- Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= n/3.A048000
Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= n/3.
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/6 of the elements are <= n/3.A048001
Number of nonempty subsets of {1,2,...,n} in which exactly 1/6 of the elements are <= n/3.
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= n/3.A048002
Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= n/3.
- Triangular array T read by rows: T(h,k) = number of binary words of length h and maximal runlength k.A048003
Triangular array T read by rows: T(h,k) = number of binary words of length h and maximal runlength k.
- Triangular array read by rows: T(n,k) = number of binary vectors of length n whose longest run of consecutive 1's has length k, for n >= 0, 0 <= k <= n.A048004
Triangular array read by rows: T(n,k) = number of binary vectors of length n whose longest run of consecutive 1's has length k, for n >= 0, 0 <= k <= n.
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-1)/3.A048005
Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-1)/3.
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/3 of the elements are <= (n-1)/3.A048006
Number of nonempty subsets of {1,2,...,n} in which exactly 1/3 of the elements are <= (n-1)/3.
- Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= (n-1)/3.A048007
Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= (n-1)/3.
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= (n-1)/3.A048008
Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= (n-1)/3.
- Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-1)/3.A048009
Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= (n-1)/3.
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-1)/3.A048010
Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-1)/3.