Sequences
392,541 sequences
- Triangle read by rows: T(n,k) gives number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords) - positive values only.A067311
Triangle read by rows: T(n,k) gives number of ways of arranging n chords on a circle with k simple intersections (i.e., no intersections with 3 or more chords) - positive values only.
- Largest leg in right triangle with relatively prime sides and hypotenuse 5^n.A067312
Largest leg in right triangle with relatively prime sides and hypotenuse 5^n.
- Numbers k such that sigma_k(k)/k is an integer, where sigma_k(k) is the sum of the k-th powers of the divisors of k (A023887).A067313
Numbers k such that sigma_k(k)/k is an integer, where sigma_k(k) is the sum of the k-th powers of the divisors of k (A023887).
- Duplicate of A066022.A067314
Duplicate of A066022.
- Numbers k such that binomial(k, floor(k/2)) is not divisible by k.A067315
Numbers k such that binomial(k, floor(k/2)) is not divisible by k.
- a(n) is the number of values of j, 0 <= j <= n, such that 1 + binomial(n,j) is prime.A067316
a(n) is the number of values of j, 0 <= j <= n, such that 1 + binomial(n,j) is prime.
- Numbers k such that 1 + binomial(k,j) is prime for only 2 values of j (0 <= j <= k).A067317
Numbers k such that 1 + binomial(k,j) is prime for only 2 values of j (0 <= j <= k).
- Sum of the reflection lengths of all permutations of n letters.A067318
Sum of the reflection lengths of all permutations of n letters.
- Numbers n such that phi(n)^phi(n)+1 is prime.A067319
Numbers n such that phi(n)^phi(n)+1 is prime.
- Even-indexed members of A067297.A067320
Even-indexed members of A067297.
- One-half of odd-indexed members of A067297.A067321
One-half of odd-indexed members of A067297.
- Odd-indexed members of A067302.A067322
Odd-indexed members of A067302.
- Catalan triangle A028364 with row reversion.A067323
Catalan triangle A028364 with row reversion.
- Third column of triangle A067323.A067324
Third column of triangle A067323.
- Fourth column of triangle A067323.A067325
Fourth column of triangle A067323.
- Fifth column of triangle A067323.A067326
Fifth column of triangle A067323.
- Triangle related to generalized Catalan numbers A064340.A067327
Triangle related to generalized Catalan numbers A064340.
- Scaled triangle A067327.A067328
Scaled triangle A067327.
- Triangle of coefficients of polynomials used for g.f.s of columns of A067304.A067329
Triangle of coefficients of polynomials used for g.f.s of columns of A067304.
- Triangle read by rows of incomplete convolutions of Fibonacci numbers F(n+1) = A000045(n+1), n>=0.A067330
Triangle read by rows of incomplete convolutions of Fibonacci numbers F(n+1) = A000045(n+1), n>=0.
- Convolution of Fibonacci F(n+1), n >= 0, with F(n+3), n >= 0.A067331
Convolution of Fibonacci F(n+1), n >= 0, with F(n+3), n >= 0.
- Convolution of Fibonacci F(n+1), n>=0, with F(n+4), n>=0.A067332
Convolution of Fibonacci F(n+1), n>=0, with F(n+4), n>=0.
- Convolution of Fibonacci F(n+1), n>=0, with F(n+5), n>=0.A067333
Convolution of Fibonacci F(n+1), n>=0, with F(n+5), n>=0.
- Convolution of Fibonacci F(n+1), n>=0, with F(n+6), n>=0.A067334
Convolution of Fibonacci F(n+1), n>=0, with F(n+6), n>=0.
- Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k-1)-(k-1)*tau(k-1) where tau(k) = A000005(k) is the number of divisors of k.A067335
Numbers k such that prime(k+1)-(k+1)*tau(k+1) = prime(k-1)-(k-1)*tau(k-1) where tau(k) = A000005(k) is the number of divisors of k.
- a(0)=1, a(1)=2, a(n) = a(n-1)*9/2 - Catalan(n-1) where Catalan(n) = binomial(2n,n)/(n+1) = A000108(n).A067336
a(0)=1, a(1)=2, a(n) = a(n-1)*9/2 - Catalan(n-1) where Catalan(n) = binomial(2n,n)/(n+1) = A000108(n).
- Triangle where T(n,k)=2*T(n,k-1)+C(n-1,k)-C(n-1,k-1) and n>=k>=0.A067337
Triangle where T(n,k)=2*T(n,k-1)+C(n-1,k)-C(n-1,k-1) and n>=k>=0.
- Divide the natural numbers in sets of consecutive numbers, starting with {1,2}, each set with number of elements equal to the sum of elements of the preceding set. The number of elements in the n-th set gives a(n).A067338
Divide the natural numbers in sets of consecutive numbers, starting with {1,2}, each set with number of elements equal to the sum of elements of the preceding set. The number of elements in the n-th set gives a(n).
- Divide the natural numbers in sets of consecutive numbers, starting with {1,2}, each set with number of elements equal to the sum of elements of the preceding set. The final element of the n-th set gives a(n).A067339
Divide the natural numbers in sets of consecutive numbers, starting with {1,2}, each set with number of elements equal to the sum of elements of the preceding set. The final element of the n-th set gives a(n).
- Numbers k such that (number of distinct prime factors of k) divides (number of prime factors of k).A067340
Numbers k such that (number of distinct prime factors of k) divides (number of prime factors of k).
- Number of prime factors divided by the number of distinct prime factors is an integer and n is neither squarefree, nor power of prime.A067341
Number of prime factors divided by the number of distinct prime factors is an integer and n is neither squarefree, nor power of prime.
- Sum of decimal digits of sum of divisors of n.A067342
Sum of decimal digits of sum of divisors of n.
- Sum of decimal digits of n equals sum of decimal digits of sum of divisors of n.A067343
Sum of decimal digits of n equals sum of decimal digits of sum of divisors of n.
- Sum of decimal digits of square of divisors of n equals sum of square of digits of n.A067344
Sum of decimal digits of square of divisors of n equals sum of square of digits of n.
- Square array read by antidiagonals: T(n,k)=(T(n,k-1)*n^2-Catalan(k-1))/(n-1) with a(n,1)=1 and a(1,k)=Catalan(k) where Catalan(k)=C(2k,k)/(k+1)=A000108(k).A067345
Square array read by antidiagonals: T(n,k)=(T(n,k-1)*n^2-Catalan(k-1))/(n-1) with a(n,1)=1 and a(1,k)=Catalan(k) where Catalan(k)=C(2k,k)/(k+1)=A000108(k).
- Square array read by antidiagonals: T(n,k)=T(n,k-1)*n^2/(n-1)-Catalan(k-1) with a(n,1)=n-1 and a(1,k)=0 where Catalan(k)=C(2k,k)/(k+1)=A000108(k).A067346
Square array read by antidiagonals: T(n,k)=T(n,k-1)*n^2/(n-1)-Catalan(k-1) with a(n,1)=n-1 and a(1,k)=0 where Catalan(k)=C(2k,k)/(k+1)=A000108(k).
- Square array read by antidiagonals: T(n,k)=(T(n,k-1)*n^2-Catalan(k-1)*n)/(n-1) with a(n,0)=1 and a(1,k)=Catalan(k) where Catalan(k)=C(2k,k)/(k+1)=A000108(k).A067347
Square array read by antidiagonals: T(n,k)=(T(n,k-1)*n^2-Catalan(k-1)*n)/(n-1) with a(n,0)=1 and a(1,k)=Catalan(k) where Catalan(k)=C(2k,k)/(k+1)=A000108(k).
- Even numbers n such that binomial(n, [n/2]) is divisible by n.A067348
Even numbers n such that binomial(n, [n/2]) is divisible by n.
- Number of divisors of sigma(n)+phi(n).A067349
Number of divisors of sigma(n)+phi(n).
- Numbers n such that sigma(n)+phi(n) has exactly 4 divisors.A067350
Numbers n such that sigma(n)+phi(n) has exactly 4 divisors.
- Numbers k such that sigma(k) + phi(k) has exactly 2 distinct prime divisors.A067351
Numbers k such that sigma(k) + phi(k) has exactly 2 distinct prime divisors.
- Divide the natural numbers in sets of consecutive numbers starting with {1,2} as the first set. The number of elements of the n-th set is equal to the sum of the n-1 final numbers in the (n-1)st set. The number of elements of the n-th set gives a(n).A067352
Divide the natural numbers in sets of consecutive numbers starting with {1,2} as the first set. The number of elements of the n-th set is equal to the sum of the n-1 final numbers in the (n-1)st set. The number of elements of the n-th set gives a(n).
- Divide the natural numbers in sets of consecutive numbers starting with {1,2} as the first set. The number of elements of the n-th set is equal to the sum of the n-1 final numbers in the (n-1)st set. The final number of the n-th set gives a(n).A067353
Divide the natural numbers in sets of consecutive numbers starting with {1,2} as the first set. The number of elements of the n-th set is equal to the sum of the n-1 final numbers in the (n-1)st set. The final number of the n-th set gives a(n).
- Numbers k such that prime(k+2)-(k+2)*tau(k+2) = prime(k-2)-(k-2)*tau(k-2) where tau(k) = A000005(k) is the number of divisors of k.A067354
Numbers k such that prime(k+2)-(k+2)*tau(k+2) = prime(k-2)-(k-2)*tau(k-2) where tau(k) = A000005(k) is the number of divisors of k.
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.A067355
Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.A067356
Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.
- Number of self-conjugate partitions of 4n+1 into odd parts.A067357
Number of self-conjugate partitions of 4n+1 into odd parts.
- Imaginary part of (5+12i)^n.A067358
Imaginary part of (5+12i)^n.
- Real part of (5 + 12i)^n.A067359
Real part of (5 + 12i)^n.
- a(n) = 17^n sin(2n arctan(1/4)) or numerator of tan(2n arctan(1/4)).A067360
a(n) = 17^n sin(2n arctan(1/4)) or numerator of tan(2n arctan(1/4)).