Sequences
392,541 sequences
- Total number of parts in all compositions of n into relatively prime parts.A085411
Total number of parts in all compositions of n into relatively prime parts.
- Numbers n such that concatenation of prime[n] and first digit of prime[n] is prime.A085412
Numbers n such that concatenation of prime[n] and first digit of prime[n] is prime.
- Prime such that concatenation of it and its first digit is prime.A085413
Prime such that concatenation of it and its first digit is prime.
- Primes that are a concatenation of a prime and its first digit.A085414
Primes that are a concatenation of a prime and its first digit.
- Take prime[n] and continue adding 1, 2, ..., a(n) until one reaches a prime.A085415
Take prime[n] and continue adding 1, 2, ..., a(n) until one reaches a prime.
- Take prime[n] and continue adding 1,2,..., A085415(n) until one reaches a prime a(n).A085416
Take prime[n] and continue adding 1,2,..., A085415(n) until one reaches a prime a(n).
- Take prime[n] and continue adding n,n+1,..., n+a(n)-1 until one reaches a prime.A085417
Take prime[n] and continue adding n,n+1,..., n+a(n)-1 until one reaches a prime.
- Primes reached in A085417.A085418
Primes reached in A085417.
- Duplicate of A083982.A085419
Duplicate of A083982.
- For each n, let p(n,b) be the smallest prime in the arithmetic progression k*n+b, with k > 0. Then a(n) = max(p(n,b)) with 0 < b < n and gcd(b,n) = 1.A085420
For each n, let p(n,b) be the smallest prime in the arithmetic progression k*n+b, with k > 0. Then a(n) = max(p(n,b)) with 0 < b < n and gcd(b,n) = 1.
- a(0)=2, a(1)=1, a(n+2)=floor[(e-1/e)*a(n+1)+a(n-2)].A085421
a(0)=2, a(1)=1, a(n+2)=floor[(e-1/e)*a(n+1)+a(n-2)].
- A sequence analogous to the Lucas numbers (A000032), with ratios converging to Pi.A085422
A sequence analogous to the Lucas numbers (A000032), with ratios converging to Pi.
- a(n) = floor(log_2(3n)).A085423
a(n) = floor(log_2(3n)).
- Number of ones in the symmetric signed digit expansion of n with q=2 (i.e., the representation of n in the (-1,0,1)_2 number system).A085424
Number of ones in the symmetric signed digit expansion of n with q=2 (i.e., the representation of n in the (-1,0,1)_2 number system).
- Number of minus ones in the symmetric signed digit expansion of n with q=2 (i.e., the representation of n in the (-1,0,1)_2 number system).A085425
Number of minus ones in the symmetric signed digit expansion of n with q=2 (i.e., the representation of n in the (-1,0,1)_2 number system).
- Duplicate of A034289.A085426
Duplicate of A034289.
- Least k such that k*2^n - 1 is prime.A085427
Least k such that k*2^n - 1 is prime.
- Sum of the smallest and largest prime divisors of the n-th composite number.A085428
Sum of the smallest and largest prime divisors of the n-th composite number.
- Numbers k such that the number of 1's in the binary expansion of k is equal to the number of 1's in the binary expansion of the reversal of k.A085429
Numbers k such that the number of 1's in the binary expansion of k is equal to the number of 1's in the binary expansion of the reversal of k.
- a(n) is the minimal m such that the group GL(m,2) has an element of order n.A085430
a(n) is the minimal m such that the group GL(m,2) has an element of order n.
- a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.A085431
a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.
- a(n) = number of triangles ABC with side lengths (n, m, p) such that n, m, p are integers, 1 <= n <= m <= p, gcd(n, m, p) = 1, the Nagel point N of ABC lies on the incircle C(I, r).A085432
a(n) = number of triangles ABC with side lengths (n, m, p) such that n, m, p are integers, 1 <= n <= m <= p, gcd(n, m, p) = 1, the Nagel point N of ABC lies on the incircle C(I, r).
- Resultant of the polynomial x^3-1 and the Chebyshev polynomial of the second kind U_n(x).A085433
Resultant of the polynomial x^3-1 and the Chebyshev polynomial of the second kind U_n(x).
- Twice odd isolated primes.A085434
Twice odd isolated primes.
- Resultant of the polynomial x^n-1 and the Chebyshev polynomial of the second kind U_2(x).A085435
Resultant of the polynomial x^n-1 and the Chebyshev polynomial of the second kind U_2(x).
- Number of partitions of n without rotational symmetry (or 1-fold symmetry).A085436
Number of partitions of n without rotational symmetry (or 1-fold symmetry).
- Duplicate of A024166.A085437
Duplicate of A024166.
- a(n) = Sum_{i=1..n} binomial(i+1,2)^3.A085438
a(n) = Sum_{i=1..n} binomial(i+1,2)^3.
- a(n) = Sum_{i=1..n} binomial(i+1,2)^4.A085439
a(n) = Sum_{i=1..n} binomial(i+1,2)^4.
- a(n) = Sum_{i=1..n} binomial(i+1,2)^5.A085440
a(n) = Sum_{i=1..n} binomial(i+1,2)^5.
- a(n) = Sum_{i=1..n} binomial(i+1,2)^6.A085441
a(n) = Sum_{i=1..n} binomial(i+1,2)^6.
- a(n) = Sum_{i=1..n} binomial(i+1,2)^7.A085442
a(n) = Sum_{i=1..n} binomial(i+1,2)^7.
- Where records in A070172 occur.A085443
Where records in A070172 occur.
- Numbers divisible by twice the sum of the products of each of their digits.A085444
Numbers divisible by twice the sum of the products of each of their digits.
- Numbers equal to exactly twice the sum of the products of each of their digits.A085445
Numbers equal to exactly twice the sum of the products of each of their digits.
- Numbers divisible by twice the sum of the products of each of their digits, excluding even multiples of 10.A085446
Numbers divisible by twice the sum of the products of each of their digits, excluding even multiples of 10.
- a(n) = 6*a(n-1) + a(n-2), starting with a(0)=2 and a(1)=6.A085447
a(n) = 6*a(n-1) + a(n-2), starting with a(0)=2 and a(1)=6.
- Primes having a semiprime number of 1's in their binary representation.A085448
Primes having a semiprime number of 1's in their binary representation.
- Horadam sequence (0,1,4,2).A085449
Horadam sequence (0,1,4,2).
- a(n) is the smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.A085450
a(n) is the smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.
- Numbers n such that n and prime[n] together use only distinct digits.A085451
Numbers n such that n and prime[n] together use only distinct digits.
- Triangle T(n,k) read by rows: T(n,k) = number of cycles of length 2k in the binary n-cube, for n >= 2, k = 2, 3, ..., 2^(n-1).A085452
Triangle T(n,k) read by rows: T(n,k) = number of cycles of length 2k in the binary n-cube, for n >= 2, k = 2, 3, ..., 2^(n-1).
- Numbers n such that n^2 and n^3 together use only distinct digits.A085453
Numbers n such that n^2 and n^3 together use only distinct digits.
- Array defined by T(i,1)=i, T(1,j)=2j, T(i,j)=T(i-1,j)+T(i-1,j-1) read by antidiagonals.A085454
Array defined by T(i,1)=i, T(1,j)=2j, T(i,j)=T(i-1,j)+T(i-1,j-1) read by antidiagonals.
- Sum_{i=0..n} Sum_{j=0..i} a(j) * a(i-j) = (-3)^n.A085455
Sum_{i=0..n} Sum_{j=0..i} a(j) * a(i-j) = (-3)^n.
- Sum_{i=0..n} Sum_{j=0..i} a(j) * a(i-j) = (-7)^n.A085456
Sum_{i=0..n} Sum_{j=0..i} a(j) * a(i-j) = (-7)^n.
- Sum_{i=0..n} Sum_{j=0..i} a(j) * a(i-j) = (-11)^n.A085457
Sum_{i=0..n} Sum_{j=0..i} a(j) * a(i-j) = (-11)^n.
- a(n) = 4*Sum_{i=0..n-1} C(2*i+1, i)*C(n-1, n-1-i)*(-1)^(n-1-i)*2^i for n > 0, a(0) = 1.A085458
a(n) = 4*Sum_{i=0..n-1} C(2*i+1, i)*C(n-1, n-1-i)*(-1)^(n-1-i)*2^i for n > 0, a(0) = 1.
- Numbers k such that k-th cyclotomic polynomial has exactly 3 positive coefficients.A085459
Numbers k such that k-th cyclotomic polynomial has exactly 3 positive coefficients.
- Primes p such that there is at least one k dividing (p-1)!-1 (p <= k <= 2p).A085460
Primes p such that there is at least one k dividing (p-1)!-1 (p <= k <= 2p).