Sequences
392,541 sequences
- Number of n-moves paths of a king starting and ending at the origin of an infinite chessboard.A094061
Number of n-moves paths of a king starting and ending at the origin of an infinite chessboard.
- a(n) = ceiling((3-sqrt(3))*4^(n-3)) + 1 for n>=2, a(1)=1.A094062
a(n) = ceiling((3-sqrt(3))*4^(n-3)) + 1 for n>=2, a(1)=1.
- Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).A094063
Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).
- Sequences has the properties shown in the Comments lines.A094064
Sequences has the properties shown in the Comments lines.
- Asymptotic form for prime.A094065
Asymptotic form for prime.
- Blind primes (no i's when written in English).A094066
Blind primes (no i's when written in English).
- Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-, the 132- and the 321-pattern is equal to k.A094067
Triangle read by rows: T(n,k) is the number of permutations p of [n] in which the length of the longest initial segment avoiding the 123-, the 132- and the 321-pattern is equal to k.
- Lessers of twin prime pairs whose greater has a prime prime index.A094068
Lessers of twin prime pairs whose greater has a prime prime index.
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.A094069
Prime(p)-4 for primes p such that prime(p) - 4 is prime.
- a(n) = A000085(n) * A000110(n).A094070
a(n) = A000085(n) * A000110(n).
- Coefficients arising in combinatorial field theory.A094071
Coefficients arising in combinatorial field theory.
- Coefficients arising in combinatorial field theory.A094072
Coefficients arising in combinatorial field theory.
- Coefficients arising in combinatorial field theory.A094073
Coefficients arising in combinatorial field theory.
- Coefficients arising in combinatorial field theory.A094074
Coefficients arising in combinatorial field theory.
- Denominator of I(n)=integral_{x=0 to 1/n}(x^2-1)^3 dx.A094075
Denominator of I(n)=integral_{x=0 to 1/n}(x^2-1)^3 dx.
- Smallest k such that prime(n) + 2^k is prime, or -1 if no such prime exists.A094076
Smallest k such that prime(n) + 2^k is prime, or -1 if no such prime exists.
- a(1)=1 and, for n>1, a(n)=a(n-1)+n if n is even and a(n)=smallest positive integer which has not yet appeared in the sequence if n is odd.A094077
a(1)=1 and, for n>1, a(n)=a(n-1)+n if n is even and a(n)=smallest positive integer which has not yet appeared in the sequence if n is odd.
- Decimal expansion of Pi + arctan(e^Pi).A094078
Decimal expansion of Pi + arctan(e^Pi).
- Least hypotenuse of primitive Pythagorean triangle whose legs differ by A058529(n).A094079
Least hypotenuse of primitive Pythagorean triangle whose legs differ by A058529(n).
- a(n)=sqrt(2*h^2 - d^2) where h=A094079 and d=A058529(n).A094080
a(n)=sqrt(2*h^2 - d^2) where h=A094079 and d=A058529(n).
- Smallest integral ladder whose ends slide over the respective distances 1 and m=2*n+1 while slipping down along horizontal ground and vertical wall against which it leans.A094081
Smallest integral ladder whose ends slide over the respective distances 1 and m=2*n+1 while slipping down along horizontal ground and vertical wall against which it leans.
- Decimal expansion of Sum_{n>=1} (n!/n^n).A094082
Decimal expansion of Sum_{n>=1} (n!/n^n).
- Numerators of ratio of sides of n-th triple of rectangles of unit area sum around a triangle.A094083
Numerators of ratio of sides of n-th triple of rectangles of unit area sum around a triangle.
- Denominators associated with A094083.A094084
Denominators associated with A094083.
- Denominator of (3*2^(n-1) - 1)*integral_{x=0 to 1/(4^n)}1-sqrt x dx.A094085
Denominator of (3*2^(n-1) - 1)*integral_{x=0 to 1/(4^n)}1-sqrt x dx.
- Babylonian reciprocals - factors needed to turn an ugly number into a power of sixty.A094086
Babylonian reciprocals - factors needed to turn an ugly number into a power of sixty.
- Domination number of the Cartesian product of two n-cycles.A094087
Domination number of the Cartesian product of two n-cycles.
- E.g.f. 1/(2-cosh(x)) (even coefficients).A094088
E.g.f. 1/(2-cosh(x)) (even coefficients).
- E.g.f.: exp(-1)*Sum((1+2*x)^binomial(n,2)/n!, n=0..infinity).A094089
E.g.f.: exp(-1)*Sum((1+2*x)^binomial(n,2)/n!, n=0..infinity).
- Decimal expansion of positive solution to 5*(1-exp(u)) + u*exp(u) = 0.A094090
Decimal expansion of positive solution to 5*(1-exp(u)) + u*exp(u) = 0.
- a(1) = 0; for n>0, a(n) = smaller of 0 and 1 such that we avoid the property that, for some i and j in the range S = 2 <= i < j <= n/2, a(i) ... a(2i) is a subsequence of a(j) ... a(2j).A094091
a(1) = 0; for n>0, a(n) = smaller of 0 and 1 such that we avoid the property that, for some i and j in the range S = 2 <= i < j <= n/2, a(i) ... a(2i) is a subsequence of a(j) ... a(2j).
- a(n) = floor(sqrt(n)^sqrt(n)).A094092
a(n) = floor(sqrt(n)^sqrt(n)).
- a(n) = ceiling((sqrt n)^(sqrt n)).A094093
a(n) = ceiling((sqrt n)^(sqrt n)).
- Define x[1]...x[n] by the equations Sum_{j=1..n} x[j]^i = i, i=1..n; a(n) = n! * Sum_{j=1..n} x[j]^(n+1).A094094
Define x[1]...x[n] by the equations Sum_{j=1..n} x[j]^i = i, i=1..n; a(n) = n! * Sum_{j=1..n} x[j]^(n+1).
- a(n)^2 is the smallest square associated with the n-th term of A090943.A094095
a(n)^2 is the smallest square associated with the n-th term of A090943.
- Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.A094096
Min{m: n = Sum((m mod (1+k*L(n)!))*2^(k-1): 1<=k<=L(n))}, where L(n) = length of binary representation of n, cf. A070939, A000142.
- Number of divisor chains of length n which begin with n ("anchored" divisor chains).A094097
Number of divisor chains of length n which begin with n ("anchored" divisor chains).
- Number of divisor chains of length n in which the first term is a divisor of n(n+1)/2 ("cyclic" divisor chains).A094098
Number of divisor chains of length n in which the first term is a divisor of n(n+1)/2 ("cyclic" divisor chains).
- Number of divisor chains of length 2n+1 which are both cyclic and anchored.A094099
Number of divisor chains of length 2n+1 which are both cyclic and anchored.
- Fit a polynomial of degree k-1 to column k of array in A048790, evaluate it at dimension n = -1.A094100
Fit a polynomial of degree k-1 to column k of array in A048790, evaluate it at dimension n = -1.
- Number of rooted 8-dimensional "polycubes" with n cells, with no symmetries removed.A094101
Number of rooted 8-dimensional "polycubes" with n cells, with no symmetries removed.
- Triangle read by rows in which row n contains Fib(1), ..., Fib(n-1), Fib(n), Fib(n-1), ..., Fib(1).A094102
Triangle read by rows in which row n contains Fib(1), ..., Fib(n-1), Fib(n), Fib(n-1), ..., Fib(1).
- a(n) = sum along n-th diagonal of A094102 (sloping downward to left).A094103
a(n) = sum along n-th diagonal of A094102 (sloping downward to left).
- Primes of the form 2*prime(n) + prime(n+1).A094104
Primes of the form 2*prime(n) + prime(n+1).
- Primes of the form prime(k) + 2*prime(k+1).A094105
Primes of the form prime(k) + 2*prime(k+1).
- a(n) is the maximal length L of a "power floor prime" sequence, i.e., a sequence of the form floor(x^k), k = 1, 2, ..., L such that floor(x) = prime(n).A094106
a(n) is the maximal length L of a "power floor prime" sequence, i.e., a sequence of the form floor(x^k), k = 1, 2, ..., L such that floor(x) = prime(n).
- Primes which can be written as prime(prime(k))-6 for some k>1.A094107
Primes which can be written as prime(prime(k))-6 for some k>1.
- Primes of form prime(n)!+prime(n+1).A094108
Primes of form prime(n)!+prime(n+1).
- Start with "I" in Roman numerals (one). The next number (in Roman numerals) describes the number of Roman numerals written previously in the sequence. Convert this infinite sequence into an infinite sequence of Arabic numbers.A094109
Start with "I" in Roman numerals (one). The next number (in Roman numerals) describes the number of Roman numerals written previously in the sequence. Convert this infinite sequence into an infinite sequence of Arabic numbers.
- Start with the word "One". The next word is the number of letters written previously. Convert this infinite sequence of words into an infinite sequence of numbers.A094110
Start with the word "One". The next word is the number of letters written previously. Convert this infinite sequence of words into an infinite sequence of numbers.