Sequences
392,541 sequences
- Palindromic even squarefree numbers with an even number of distinct prime factors.A075811
Palindromic even squarefree numbers with an even number of distinct prime factors.
- Palindromic odd numbers with exactly 2 prime factors (counted with multiplicity).A075812
Palindromic odd numbers with exactly 2 prime factors (counted with multiplicity).
- Palindromic even numbers with exactly 2 prime factors (counted with multiplicity). Equivalently, palindromic numbers of the form 2*p with p prime.A075813
Palindromic even numbers with exactly 2 prime factors (counted with multiplicity). Equivalently, palindromic numbers of the form 2*p with p prime.
- Palindromic odd numbers with exactly 3 prime factors (counted with multiplicity).A075814
Palindromic odd numbers with exactly 3 prime factors (counted with multiplicity).
- Palindromic odd composite numbers with an odd number of prime factors (counted with multiplicity).A075815
Palindromic odd composite numbers with an odd number of prime factors (counted with multiplicity).
- Palindromic even numbers with exactly 3 prime factors (counted with multiplicity).A075816
Palindromic even numbers with exactly 3 prime factors (counted with multiplicity).
- Palindromic even numbers with an odd number of prime factors (counted with multiplicity).A075817
Palindromic even numbers with an odd number of prime factors (counted with multiplicity).
- Even numbers with exactly 3 prime factors (counted with multiplicity).A075818
Even numbers with exactly 3 prime factors (counted with multiplicity).
- Even squarefree numbers with exactly 3 prime factors.A075819
Even squarefree numbers with exactly 3 prime factors.
- Coefficients of power series generated by the continued fraction-like form: A(x) = 1/(1 - x/sqrt(1 - 4x/cube-root(1 - 9x/4th-root(1 - 16x/5th-root(1 - 25x/... /n-th-root(1 - (n^2)x/...)))))), where n-th-root(z)=z^(1/n).A075820
Coefficients of power series generated by the continued fraction-like form: A(x) = 1/(1 - x/sqrt(1 - 4x/cube-root(1 - 9x/4th-root(1 - 16x/5th-root(1 - 25x/... /n-th-root(1 - (n^2)x/...)))))), where n-th-root(z)=z^(1/n).
- List of possible last two digits (leading zeros omitted) of perfect powers.A075821
List of possible last two digits (leading zeros omitted) of perfect powers.
- Smallest perfect power for each possible two-digit ending, ordered by their last two digits (leading zeros omitted).A075822
Smallest perfect power for each possible two-digit ending, ordered by their last two digits (leading zeros omitted).
- Numbers that are not the last two digits (leading zeros omitted) of any perfect power.A075823
Numbers that are not the last two digits (leading zeros omitted) of any perfect power.
- Odd numbers that cannot be expressed as 2^k - 3^m where k and m are integers.A075824
Odd numbers that cannot be expressed as 2^k - 3^m where k and m are integers.
- a(0) = 1, a(1) = 2; for n>0, a(2n) = |a(n)-a(n-1)|, a(2n+1) = a(n)+a(n-1).A075825
a(0) = 1, a(1) = 2; for n>0, a(2n) = |a(n)-a(n-1)|, a(2n+1) = a(n)+a(n-1).
- n minus (number of letters in English name of n).A075826
n minus (number of letters in English name of n).
- Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(a(n)*x + b(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.A075827
Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(a(n)*x + b(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.
- Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(b(n)*x + a(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.A075828
Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(b(n)*x + a(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.
- Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) = (b(n)*x + c(n))/(d(n)*x + a(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.A075829
Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) = (b(n)*x + c(n))/(d(n)*x + a(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.
- Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) = (b(n)*x + c(n))/(a(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.A075830
Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) = (b(n)*x + c(n))/(a(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.
- Like A073327, but multiply the numerical values of the letters instead of adding them.A075831
Like A073327, but multiply the numerical values of the letters instead of adding them.
- Let u(1) = u(2) = u(3) = u(4) = 1, u(n+4)*(n+4) = u(n+3)*(n+3)+u(n+2)*(n+2)+u(n+1)*(n+1)+u(n)*n; sequence gives values of n such that u(n) is an integer.A075832
Let u(1) = u(2) = u(3) = u(4) = 1, u(n+4)*(n+4) = u(n+3)*(n+3)+u(n+2)*(n+2)+u(n+1)*(n+1)+u(n)*n; sequence gives values of n such that u(n) is an integer.
- a(n) is the least k such that for any p prime dividing n, p does not divide binomial((n+1)*k, k+1), or -1 if no such k exists.A075833
a(n) is the least k such that for any p prime dividing n, p does not divide binomial((n+1)*k, k+1), or -1 if no such k exists.
- Coefficients of power series A(x) such that n-th term of A(x)^n = n! x^(n-1) for n > 0.A075834
Coefficients of power series A(x) such that n-th term of A(x)^n = n! x^(n-1) for n > 0.
- Numbers k such that 13*k^2 + 4 is a square.A075835
Numbers k such that 13*k^2 + 4 is a square.
- Numbers k such that 10*k^2 + 9 is a square.A075836
Numbers k such that 10*k^2 + 9 is a square.
- Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.A075837
Triangle T(n,k) = f(n,k,n-2), n >= 0, 0 <= k <= n, where f is given below.
- Decimal expansion of the solution to the donkey problem.A075838
Decimal expansion of the solution to the donkey problem.
- Numbers k such that 11*k^2 - 2 is a square.A075839
Numbers k such that 11*k^2 - 2 is a square.
- Primes of the form (2*n)!/(n!)^2+1.A075840
Primes of the form (2*n)!/(n!)^2+1.
- Numbers k such that 2*k^2 - 9 is a square.A075841
Numbers k such that 2*k^2 - 9 is a square.
- n 1's followed by n.A075842
n 1's followed by n.
- Numbers k such that 99*k^2 + 1 is a square.A075843
Numbers k such that 99*k^2 + 1 is a square.
- Numbers k such that 11*k^2 + 4 is a square.A075844
Numbers k such that 11*k^2 + 4 is a square.
- Associated to determinants of skew-symmetric matrices related to Catalan-numbers or central binomial coefficients.A075845
Associated to determinants of skew-symmetric matrices related to Catalan-numbers or central binomial coefficients.
- Numbers k such that sopf(k) = (1/2)*(sopf(k+1) + sopf(k-1)), where sopf(x) = sum of the distinct prime factors of x.A075846
Numbers k such that sopf(k) = (1/2)*(sopf(k+1) + sopf(k-1)), where sopf(x) = sum of the distinct prime factors of x.
- Difference between n^2 and the largest cube <= n^2.A075847
Difference between n^2 and the largest cube <= n^2.
- Numbers k such that 2*k^2 + 9 is a square.A075848
Numbers k such that 2*k^2 + 9 is a square.
- a(1) = a(2) = 1; a(n) = a(n-1)! + a(n-2) for n > 2.A075849
a(1) = a(2) = 1; a(n) = a(n-1)! + a(n-2) for n > 2.
- Greatest k such that f(k,1) divides f(k,n) where f(k,n) is the k-th term of the sequence: f(1,n)=1, f(2,n)=n, f(k+2,n)=f(k+1,n)+f(k,n).A075850
Greatest k such that f(k,1) divides f(k,n) where f(k,n) is the k-th term of the sequence: f(1,n)=1, f(2,n)=n, f(k+2,n)=f(k+1,n)+f(k,n).
- Number of permutations s of {1,2,...,n} such that |s(i)-i|>2 for each i=1,2,...,n.A075851
Number of permutations s of {1,2,...,n} such that |s(i)-i|>2 for each i=1,2,...,n.
- Number of permutations s of {1,2,...,n} such that |s(i)-i|>3 for each i=1,2,...,n.A075852
Number of permutations s of {1,2,...,n} such that |s(i)-i|>3 for each i=1,2,...,n.
- G.f. satisfies A(x) = 1 + x (1+Sum_{n=0..inf} [xA(x)]^(2^n)).A075853
G.f. satisfies A(x) = 1 + x (1+Sum_{n=0..inf} [xA(x)]^(2^n)).
- Smallest integer composed of digits 1..n such that no subsequence is repeated and every possible subsequence of length 2 appears.A075854
Smallest integer composed of digits 1..n such that no subsequence is repeated and every possible subsequence of length 2 appears.
- Maximum number of black squares on an n X n chessboard (with a black square in at least one corner) that can be covered by a single path, traveling only to adjacent black squares.A075855
Maximum number of black squares on an n X n chessboard (with a black square in at least one corner) that can be covered by a single path, traveling only to adjacent black squares.
- Triangle formed from coefficients of the polynomials p(1)=x, p(n+1) = (n + x*(n+1))*p(n) + x*x*(d/dx)p(n).A075856
Triangle formed from coefficients of the polynomials p(1)=x, p(n+1) = (n + x*(n+1))*p(n) + x*x*(d/dx)p(n).
- Least common multiple of totient and cototient of n.A075857
Least common multiple of totient and cototient of n.
- n followed by n 1's.A075858
n followed by n 1's.
- a(n) = n concatenated with n 1's and n.A075859
a(n) = n concatenated with n 1's and n.
- a(n) is the fixed point reached when the map x -> A008472(x) is iterated, starting from x = n, with the convention a(1)=0.A075860
a(n) is the fixed point reached when the map x -> A008472(x) is iterated, starting from x = n, with the convention a(1)=0.