Sequences
392,541 sequences
- Column 5 of A048790.A094161
Column 5 of A048790.
- Where n first appears in A093320.A094162
Where n first appears in A093320.
- Numbers that do not appear in A093321.A094163
Numbers that do not appear in A093321.
- Number of rooted 2-dimensional polyominoes with n triangular cells, with no symmetries removed.A094164
Number of rooted 2-dimensional polyominoes with n triangular cells, with no symmetries removed.
- Number of rooted 2-dimensional polyominoes with n hexagonal cells, with no symmetries removed.A094165
Number of rooted 2-dimensional polyominoes with n hexagonal cells, with no symmetries removed.
- Array read by antidiagonals: T(n,k) = number of rooted 2-dimensional polyominoes with k cells, the cells being regular n-gons, with no symmetries removed.A094166
Array read by antidiagonals: T(n,k) = number of rooted 2-dimensional polyominoes with k cells, the cells being regular n-gons, with no symmetries removed.
- Duplicate of A051738.A094167
Duplicate of A051738.
- Number of rooted 2-dimensional polyominoes with n heptagonal cells, with no symmetries removed.A094168
Number of rooted 2-dimensional polyominoes with n heptagonal cells, with no symmetries removed.
- Number of rooted 2-dimensional polyominoes with n octagonal cells, with no symmetries removed.A094169
Number of rooted 2-dimensional polyominoes with n octagonal cells, with no symmetries removed.
- Number of quasi-triominoes in an n X n bounding box.A094170
Number of quasi-triominoes in an n X n bounding box.
- Number of quasi-tetrominoes in an n X n bounding box.A094171
Number of quasi-tetrominoes in an n X n bounding box.
- Number of quasi-pentominoes in an n X n bounding box.A094172
Number of quasi-pentominoes in an n X n bounding box.
- a(n) = m if m has already occurred at least once and n=k+i*(m+1) where k is the index of the first occurrence of n and i=1,...,max(n-1,1), otherwise a(n) = least positive integer that has not yet occurred.A094173
a(n) = m if m has already occurred at least once and n=k+i*(m+1) where k is the index of the first occurrence of n and i=1,...,max(n-1,1), otherwise a(n) = least positive integer that has not yet occurred.
- a(n) is the smallest number requiring n letters (in French).A094174
a(n) is the smallest number requiring n letters (in French).
- Round( n / sum of digits of n ).A094175
Round( n / sum of digits of n ).
- (A047926(n)-A091588(n))/2.A094176
(A047926(n)-A091588(n))/2.
- Sequence from an aptitude test that I cannot work out!A094177
Sequence from an aptitude test that I cannot work out!
- Numbers n such that 4n+1 is divisible only by primes of form 4m+1 (i.e., by the Pythagorean primes A002144).A094178
Numbers n such that 4n+1 is divisible only by primes of form 4m+1 (i.e., by the Pythagorean primes A002144).
- Numbers congruent to 3 mod 4 which are divisible only by primes congruent to 3 mod 4.A094179
Numbers congruent to 3 mod 4 which are divisible only by primes congruent to 3 mod 4.
- Numbers k such that 4*k-1 is divisible only by primes of form 4*m-1 (i.e., by the Gaussian primes A002145).A094180
Numbers k such that 4*k-1 is divisible only by primes of form 4*m-1 (i.e., by the Gaussian primes A002145).
- a(n) = (n - tau(n))*(n - phi(n)), where tau=A000005 and phi=A000010.A094181
a(n) = (n - tau(n))*(n - phi(n)), where tau=A000005 and phi=A000010.
- Inradii of primitive Pythagorean triangles, sorted on area A024406(n), then on inradii.A094182
Inradii of primitive Pythagorean triangles, sorted on area A024406(n), then on inradii.
- Semiperimeter of primitive Pythagorean triangles, sorted on area A024406(n), then on semiperimeter.A094183
Semiperimeter of primitive Pythagorean triangles, sorted on area A024406(n), then on semiperimeter.
- Triangle read by rows in which each term equals the entry above minus the entry left plus twice the entry left-above.A094184
Triangle read by rows in which each term equals the entry above minus the entry left plus twice the entry left-above.
- Number of solutions to n == xy (mod z) == yz (mod x) == zx (mod y) with 0 < x < y < z.A094185
Number of solutions to n == xy (mod z) == yz (mod x) == zx (mod y) with 0 < x < y < z.
- Taking a(1)=0 and a(2)=1, sequence (a(n))n>1 is defined as follows : letting w(k)=a(1)a(2)...a(k) and w(infinity)= limit k ->infinity a(1)a(2)w(1)w(2)...w(k) we have w(infinity)=a(1)a(2)a(3)a(4)...A094186
Taking a(1)=0 and a(2)=1, sequence (a(n))n>1 is defined as follows : letting w(k)=a(1)a(2)...a(k) and w(infinity)= limit k ->infinity a(1)a(2)w(1)w(2)...w(k) we have w(infinity)=a(1)a(2)a(3)a(4)...
- Numerator of I(n) = Integral_{x=1..9/8} (sqrt(x^2-1)/x)^(2*n) dx.A094187
Numerator of I(n) = Integral_{x=1..9/8} (sqrt(x^2-1)/x)^(2*n) dx.
- Number of levels in the compositions of n with odd summands.A094188
Number of levels in the compositions of n with odd summands.
- Number of primes between n^2-n and n^2 (inclusive).A094189
Number of primes between n^2-n and n^2 (inclusive).
- Least n-digit automorphic number.A094190
Least n-digit automorphic number.
- a(n) = smallest positive number that occurs exactly n times as a difference between two positive squares.A094191
a(n) = smallest positive number that occurs exactly n times as a difference between two positive squares.
- Values x of the generator pairs (x, y), x>y of primitive Pythagorean triples, sorted.A094192
Values x of the generator pairs (x, y), x>y of primitive Pythagorean triples, sorted.
- Values y of the generator pairs (x, y), x>y of primitive Pythagorean triples, sorted on x.A094193
Values y of the generator pairs (x, y), x>y of primitive Pythagorean triples, sorted on x.
- Hypotenuses x^2 + y^2 of primitive Pythagorean triangles, sorted on values x of the generator pair (x, y), x>y.A094194
Hypotenuses x^2 + y^2 of primitive Pythagorean triangles, sorted on values x of the generator pair (x, y), x>y.
- Expansion of g.f.: (1-4*x)/((1-5*x)*(1-x)^2).A094195
Expansion of g.f.: (1-4*x)/((1-5*x)*(1-x)^2).
- Indices of the start of a string of 24 consecutive squares whose sum is a square.A094196
Indices of the start of a string of 24 consecutive squares whose sum is a square.
- First integral ladder to be largest perpendicular-corner-bending for exactly n distinct pairs of integral corridor widths.A094197
First integral ladder to be largest perpendicular-corner-bending for exactly n distinct pairs of integral corridor widths.
- Number of ways that n boxes with distinct sizes can contain each other under the condition that each box may contain at most three (themselves possibly nested) boxes. Each box is assumed to be large enough to contain any three smaller boxes.A094198
Number of ways that n boxes with distinct sizes can contain each other under the condition that each box may contain at most three (themselves possibly nested) boxes. Each box is assumed to be large enough to contain any three smaller boxes.
- a(0) = -1/2; for n > 0, a(n) = 2*(5*n-4)*(5*n-6)*a(n-1) + Sum_{k=1..n-1} a(k)*a(n-k).A094199
a(0) = -1/2; for n > 0, a(n) = 2*(5*n-4)*(5*n-6)*a(n-1) + Sum_{k=1..n-1} a(k)*a(n-k).
- a(n) = 16*n^4 + 32*n^3 + 36*n^2 + 20*n + 3.A094200
a(n) = 16*n^4 + 32*n^3 + 36*n^2 + 20*n + 3.
- a(n) = 4*n^5 + 10*n^4 + 13*n^3 + 11*n^2 + 5*n + 1.A094201
a(n) = 4*n^5 + 10*n^4 + 13*n^3 + 11*n^2 + 5*n + 1.
- Integers k whose Zeckendorf representation A014417(k) is palindromic.A094202
Integers k whose Zeckendorf representation A014417(k) is palindromic.
- a(n) = 24 written in base 13-n.A094203
a(n) = 24 written in base 13-n.
- Duplicate of A078584.A094204
Duplicate of A078584.
- Lower bounds of twin prime pairs of the form prime(2n+1).A094205
Lower bounds of twin prime pairs of the form prime(2n+1).
- a(n) = number of consistent orderings of 1..n based only on factorization.A094206
a(n) = number of consistent orderings of 1..n based only on factorization.
- a(n) = prime(4n-3) + prime(4n-2) + prime(4n-1) + prime(4n).A094207
a(n) = prime(4n-3) + prime(4n-2) + prime(4n-1) + prime(4n).
- Least vampire number with n fang pairs.A094208
Least vampire number with n fang pairs.
- Numbers n such that the sum of n's digits times the sum of the factorials of n's digits is equal to n.A094209
Numbers n such that the sum of n's digits times the sum of the factorials of n's digits is equal to n.
- Numbers k such that k^2 + 3k + 1 is a prime.A094210
Numbers k such that k^2 + 3k + 1 is a prime.