Sequences
392,541 sequences
- Fibonacci numbers whose digits sum to a square.A065411
Fibonacci numbers whose digits sum to a square.
- a(n) = (A005867(n+1) - A000165(n))/96.A065412
a(n) = (A005867(n+1) - A000165(n))/96.
- Number of positive solutions to "numbers that are n times their number of binary 1's".A065413
Number of positive solutions to "numbers that are n times their number of binary 1's".
- Decimal expansion of rank 2 Artin constant Product_{p prime} (1-1/(p^3-p^2)).A065414
Decimal expansion of rank 2 Artin constant Product_{p prime} (1-1/(p^3-p^2)).
- Decimal expansion of Product_{p prime} (1-1/(p^4-p^3)).A065415
Decimal expansion of Product_{p prime} (1-1/(p^4-p^3)).
- Decimal expansion of Product_{p prime} (1-1/(p^5-p^4)).A065416
Decimal expansion of Product_{p prime} (1-1/(p^5-p^4)).
- Exponents in expansion of rank-2 Artin constant product(1-1/(p^3-p^2), p=prime) as a product zeta(n)^(-a(n)).A065417
Exponents in expansion of rank-2 Artin constant product(1-1/(p^3-p^2), p=prime) as a product zeta(n)^(-a(n)).
- Decimal expansion of Hardy-Littlewood constant Product_{p prime >= 5} (1-(3*p-1)/(p-1)^3).A065418
Decimal expansion of Hardy-Littlewood constant Product_{p prime >= 5} (1-(3*p-1)/(p-1)^3).
- Decimal expansion of Hardy-Littlewood constant Product_{p prime >= 5} (1-(6*p^2-4*p+1)/(p-1)^4).A065419
Decimal expansion of Hardy-Littlewood constant Product_{p prime >= 5} (1-(6*p^2-4*p+1)/(p-1)^4).
- Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.A065420
Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.
- Decimal expansion of Viggo Brun's constant B, also known as the twin primes constant B_2: Sum (1/p + 1/q) as (p,q) runs through the twin primes.A065421
Decimal expansion of Viggo Brun's constant B, also known as the twin primes constant B_2: Sum (1/p + 1/q) as (p,q) runs through the twin primes.
- If n | a(n) then a(n+1) = a(n)/(highest power of n that divides a(n)), otherwise a(n+1) = n*a(n); a(0) = 1.A065422
If n | a(n) then a(n+1) = a(n)/(highest power of n that divides a(n)), otherwise a(n+1) = n*a(n); a(0) = 1.
- Number of ordered length 2 compositions of n with at least one even summand.A065423
Number of ordered length 2 compositions of n with at least one even summand.
- Catalan-like formula: a(n) = binomial(6*n, 3*n+1)/(9*n+6).A065424
Catalan-like formula: a(n) = binomial(6*n, 3*n+1)/(9*n+6).
- Smallest odd prime greater than n such that the decimal expansion of its base n conversion is also prime.A065425
Smallest odd prime greater than n such that the decimal expansion of its base n conversion is also prime.
- Incrementally larger terms in the continued fraction (A065645) for the twin prime constant (A005597).A065426
Incrementally larger terms in the continued fraction (A065645) for the twin prime constant (A005597).
- q-expansion of a differential resolvent.A065427
q-expansion of a differential resolvent.
- Numbers k such that no x^2 mod k is prime.A065428
Numbers k such that no x^2 mod k is prime.
- Number of permutations of {1..n} which contain 3 consecutive terms in increasing order.A065429
Number of permutations of {1..n} which contain 3 consecutive terms in increasing order.
- Order of commutator subgroup of GL(2,Z_n) (invertible 2 X 2 matrices mod n: A000252).A065430
Order of commutator subgroup of GL(2,Z_n) (invertible 2 X 2 matrices mod n: A000252).
- Continued fraction expansion of Hardy-Littlewood constant (A065419) Product_{p prime >= 5} (1-(6*p^2-4*p+1)/(p-1)^4).A065431
Continued fraction expansion of Hardy-Littlewood constant (A065419) Product_{p prime >= 5} (1-(6*p^2-4*p+1)/(p-1)^4).
- Triangle related to Catalan triangle: recurrence related to A033877 (Schroeder numbers).A065432
Triangle related to Catalan triangle: recurrence related to A033877 (Schroeder numbers).
- Numbers n such that there exist x, y with n^2 = x! + y!.A065433
Numbers n such that there exist x, y with n^2 = x! + y!.
- Decimal expansion of imaginary part of 2nd nontrivial zero of Riemann zeta function.A065434
Decimal expansion of imaginary part of 2nd nontrivial zero of Riemann zeta function.
- a(3) = 2, a(4) = 3; for n > 4, a(n) = {a(n-2)}+{a(n-1)}, where {a} means largest prime <= a.A065435
a(3) = 2, a(4) = 3; for n > 4, a(n) = {a(n-2)}+{a(n-1)}, where {a} means largest prime <= a.
- Duplicate of A055500.A065436
Duplicate of A055500.
- Smallest base relative to which the n-th prime is palindromic.A065437
Smallest base relative to which the n-th prime is palindromic.
- Complement of A065039.A065438
Complement of A065039.
- Numbers n such that s[n], p[n] and s[n]+p[n] are all prime numbers, where s[n] is the sum of digits of n and p[n] is the product of digits of n.A065439
Numbers n such that s[n], p[n] and s[n]+p[n] are all prime numbers, where s[n] is the sum of digits of n and p[n] is the product of digits of n.
- a(n) = (n-1)^n.A065440
a(n) = (n-1)^n.
- Sum of absolute values of terms in n-th row of A065432.A065441
Sum of absolute values of terms in n-th row of A065432.
- Decimal expansion of Erdős-Borwein constant Sum_{k>=1} 1/(2^k - 1).A065442
Decimal expansion of Erdős-Borwein constant Sum_{k>=1} 1/(2^k - 1).
- Decimal expansion of Sum_{k=1..inf} 1/(2^k-1)^2.A065443
Decimal expansion of Sum_{k=1..inf} 1/(2^k-1)^2.
- Decimal expansion of 9*Sum_{k>=1} 1/(10^k-1).A065444
Decimal expansion of 9*Sum_{k>=1} 1/(10^k-1).
- Decimal expansion of Product{k=0..inf} (1+1/2^(2k))^(1/2).A065445
Decimal expansion of Product{k=0..inf} (1+1/2^(2k))^(1/2).
- Decimal expansion of Product_{k>=1} (1-1/2^k)^(-1).A065446
Decimal expansion of Product_{k>=1} (1-1/2^k)^(-1).
- Concatenation of 1, 00, 111, 0000, ..., n 1's (if n is odd) or n 0's (if n is even).A065447
Concatenation of 1, 00, 111, 0000, ..., n 1's (if n is odd) or n 0's (if n is even).
- Numbers k such that k is congruent to the product of its digits modulo the sum of its digits.A065448
Numbers k such that k is congruent to the product of its digits modulo the sum of its digits.
- a(n) = phi(Fibonacci(n)).A065449
a(n) = phi(Fibonacci(n)).
- Make an infinite chessboard from the squares in the first quadrant; sequence gives number of squares a knight can reach in n moves starting at the origin.A065450
Make an infinite chessboard from the squares in the first quadrant; sequence gives number of squares a knight can reach in n moves starting at the origin.
- a(n) = Fibonacci(phi(n)), a(0) = 0.A065451
a(n) = Fibonacci(phi(n)), a(0) = 0.
- Decimal expansion of imaginary part of 3rd nontrivial zero of Riemann zeta function.A065452
Decimal expansion of imaginary part of 3rd nontrivial zero of Riemann zeta function.
- Decimal expansion of imaginary part of 4th nontrivial zero of Riemann zeta function.A065453
Decimal expansion of imaginary part of 4th nontrivial zero of Riemann zeta function.
- Let the k-th harmonic number be H(k) = Sum_{i=1..k} 1/i = P(k)/Q(k) = A001008(k)/A002805(k); sequence gives values of k such that Q(k) = Q(k+1).A065454
Let the k-th harmonic number be H(k) = Sum_{i=1..k} 1/i = P(k)/Q(k) = A001008(k)/A002805(k); sequence gives values of k such that Q(k) = Q(k+1).
- Number of (binary) bit strings of length n in which no even block of 0's is followed by an odd block of 1's.A065455
Number of (binary) bit strings of length n in which no even block of 0's is followed by an odd block of 1's.
- Number of functions on n labeled nodes whose representation as a digraph has two components.A065456
Number of functions on n labeled nodes whose representation as a digraph has two components.
- Period of the flip-riffle shuffle function on a deck of 2n cards.A065457
Period of the flip-riffle shuffle function on a deck of 2n cards.
- Number of inequivalent (ordered) solutions to a^2 + b^2 + c^2 + d^2 = n^2.A065458
Number of inequivalent (ordered) solutions to a^2 + b^2 + c^2 + d^2 = n^2.
- Number of inequivalent (ordered) solutions to n^2 = sum of 5 squares of integers >= 0.A065459
Number of inequivalent (ordered) solutions to n^2 = sum of 5 squares of integers >= 0.
- Number of inequivalent (ordered) solutions to n^2 = sum of 6 squares of integers >= 0.A065460
Number of inequivalent (ordered) solutions to n^2 = sum of 6 squares of integers >= 0.