Sequences
392,541 sequences
- a(n) = Sum_{k=0..n-1} 7^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.A083011
a(n) = Sum_{k=0..n-1} 7^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.
- a(n) = Sum_{k=0..n-1} 8^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.A083012
a(n) = Sum_{k=0..n-1} 8^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.
- a(n) = Sum_{k=0..n-1} 9^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.A083013
a(n) = Sum_{k=0..n-1} 9^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.
- a(n) = Sum_{k=0..n-1} 10^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.A083014
a(n) = Sum_{k=0..n-1} 10^k*B(k)*binomial(n,k) where B(k) is the k-th Bernoulli number.
- a(n) = the number of ordered pairs of n-bit bit strings, such that both bit strings have at least n/2 one-bits, or both have at most n/2 one-bits.A083015
a(n) = the number of ordered pairs of n-bit bit strings, such that both bit strings have at least n/2 one-bits, or both have at most n/2 one-bits.
- Rearrangement of primes such that the sum of two consecutive terms is a square.A083016
Rearrangement of primes such that the sum of two consecutive terms is a square.
- Primes whose 10's complement is a palindrome.A083017
Primes whose 10's complement is a palindrome.
- Primes whose 10's complement is a cube.A083018
Primes whose 10's complement is a cube.
- Number of common divisors of n and F(n) where F(n) denotes the n-th Fibonacci number.A083019
Number of common divisors of n and F(n) where F(n) denotes the n-th Fibonacci number.
- Irregular triangle read by row of the prime factors of 3^(3^n) + 2.A083020
Irregular triangle read by row of the prime factors of 3^(3^n) + 2.
- a(n) = the number of distinct primes of the form p(n)#/p(i) + p(i).A083021
a(n) = the number of distinct primes of the form p(n)#/p(i) + p(i).
- Numbers n such that 4*n^2 - 3 is prime.A083022
Numbers n such that 4*n^2 - 3 is prime.
- a(n) = number of partitions of n into a pair of parts n=p+q, p>=q>=0, with p-q equal to a square >= 0.A083023
a(n) = number of partitions of n into a pair of parts n=p+q, p>=q>=0, with p-q equal to a square >= 0.
- Molien series for action of SL(3,C) on ternary forms of degree 4.A083024
Molien series for action of SL(3,C) on ternary forms of degree 4.
- Number of primes congruent to 1 modulo 4 dividing n (with multiplicity).A083025
Number of primes congruent to 1 modulo 4 dividing n (with multiplicity).
- Numbers that are congruent to {0, 2, 4, 5, 7, 9, 11} mod 12.A083026
Numbers that are congruent to {0, 2, 4, 5, 7, 9, 11} mod 12.
- Duplicate of A060107.A083027
Duplicate of A060107.
- Numbers that are congruent to {0, 2, 3, 5, 7, 8, 11} mod 12.A083028
Numbers that are congruent to {0, 2, 3, 5, 7, 8, 11} mod 12.
- Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal.A083029
Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal.
- Numbers that are congruent to {0, 4, 7} mod 12.A083030
Numbers that are congruent to {0, 4, 7} mod 12.
- Numbers that are congruent to {0, 3, 7} mod 12.A083031
Numbers that are congruent to {0, 3, 7} mod 12.
- Numbers that are congruent to {0, 4, 7, 10} mod 12.A083032
Numbers that are congruent to {0, 4, 7, 10} mod 12.
- Numbers that are congruent to {0, 2, 3, 5, 7, 9, 10} mod 12.A083033
Numbers that are congruent to {0, 2, 3, 5, 7, 9, 10} mod 12.
- Numbers that are congruent to {0, 1, 3, 5, 7, 8, 10} mod 12.A083034
Numbers that are congruent to {0, 1, 3, 5, 7, 8, 10} mod 12.
- a(n) = floor(sqrt(2)*n)-2*floor(n/sqrt(2)).A083035
a(n) = floor(sqrt(2)*n)-2*floor(n/sqrt(2)).
- Partial sums of A083035.A083036
Partial sums of A083035.
- a(n)=2*A083036(n)-n. Also -A123737(n).A083037
a(n)=2*A083036(n)-n. Also -A123737(n).
- A fractal sequence.A083038
A fractal sequence.
- Number of divisors of n that are <= 3.A083039
Number of divisors of n that are <= 3.
- Number of divisors of n that are <= 4.A083040
Number of divisors of n that are <= 4.
- Number of symmetric sum-free subsets of {1,2,...,n-1} with sums taken mod n.A083041
Number of symmetric sum-free subsets of {1,2,...,n-1} with sums taken mod n.
- Duplicate of A082977.A083042
Duplicate of A082977.
- Integers y such that 11*x^2 - 9*y^2 = 2 for some integer x.A083043
Integers y such that 11*x^2 - 9*y^2 = 2 for some integer x.
- Square table read by antidiagonals forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), where x=3/2, n >= 0, k >= 0.A083044
Square table read by antidiagonals forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), where x=3/2, n >= 0, k >= 0.
- Main diagonal of table A083044.A083045
Main diagonal of table A083044.
- Antidiagonal sums of table A083044.A083046
Antidiagonal sums of table A083044.
- Square table read by antidiagonals forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), where x = (sqrt(5)+1)/2, n>=0, k>=0.A083047
Square table read by antidiagonals forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), where x = (sqrt(5)+1)/2, n>=0, k>=0.
- Main diagonal of table A083047.A083048
Main diagonal of table A083047.
- Antidiagonal sums of table A083047.A083049
Antidiagonal sums of table A083047.
- Square table read by antidiagonals forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), where x = sqrt(2), n>=0, k>=0.A083050
Square table read by antidiagonals forms a permutation of the natural numbers: T(n,0) = floor(n*x/(x-1))+1, T(n,k+1) = ceiling(x*T(n,k)), where x = sqrt(2), n>=0, k>=0.
- First column of table A083050.A083051
First column of table A083050.
- Main diagonal of table A083050.A083052
Main diagonal of table A083050.
- Antidiagonal sums of table A083050.A083053
Antidiagonal sums of table A083050.
- a(n) = floor(sqrt(3)*n) - 3*floor(n/sqrt(3)).A083054
a(n) = floor(sqrt(3)*n) - 3*floor(n/sqrt(3)).
- a(n) = cardinality{ k<=n / A083054(k)=1}.A083055
a(n) = cardinality{ k<=n / A083054(k)=1}.
- a(n) = 3*A083055(n)-n.A083056
a(n) = 3*A083055(n)-n.
- Partial sums of A083056.A083057
Partial sums of A083056.
- Number of eigenvalues equal to 1 of n X n matrix A(i,j)=1 if j=1 or i divides j.A083058
Number of eigenvalues equal to 1 of n X n matrix A(i,j)=1 if j=1 or i divides j.
- a(n) is the number of natural numbers k such that A078496(k)=n.A083059
a(n) is the number of natural numbers k such that A078496(k)=n.
- a(n) is the number of natural numbers k such that A078496(k) = prime(n), where prime(n) denotes the n-th prime.A083060
a(n) is the number of natural numbers k such that A078496(k) = prime(n), where prime(n) denotes the n-th prime.