Sequences
392,541 sequences
- a(1)=1, a(n) = 2*(n^(n-1)-1)/(n-1) for n >= 2.A093461
a(1)=1, a(n) = 2*(n^(n-1)-1)/(n-1) for n >= 2.
- a(1)=1, a(n) = 2(n^(n-1)-1)/(n-1)^2.A093462
a(1)=1, a(n) = 2(n^(n-1)-1)/(n-1)^2.
- a(1) = 1; for n>1, a(n) = n*a(n-1) + 1 if n is a prime else a(n) = n*a(n-1) - 1.A093463
a(1) = 1; for n>1, a(n) = n*a(n-1) + 1 if n is a prime else a(n) = n*a(n-1) - 1.
- a(1) = 1; for n>1, a(n) = n*a(n-1) - 1 if n is a prime else a(n) = n*a(n-1) + 1.A093464
a(1) = 1; for n>1, a(n) = n*a(n-1) - 1 if n is a prime else a(n) = n*a(n-1) + 1.
- Minimal number of vertices in polyhedron of genus n.A093465
Minimal number of vertices in polyhedron of genus n.
- Triangle read by rows: T[n,k] = number of n X n binary matrices with k=0...n^2 ones, distinct up to cyclic shifts of rows and columns; reflection through any vertical or horizontal axis; and reflection through the main diagonal. Also, quasi-n-ominoes on a torus divided into a k X k grid.A093466
Triangle read by rows: T[n,k] = number of n X n binary matrices with k=0...n^2 ones, distinct up to cyclic shifts of rows and columns; reflection through any vertical or horizontal axis; and reflection through the main diagonal. Also, quasi-n-ominoes on a torus divided into a k X k grid.
- a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).A093467
a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum_{i = 1..n} (a(i) - a(1)).
- a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(n)-a(i), i = 1 to n}.A093468
a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(n)-a(i), i = 1 to n}.
- Number of 6 X 6 binary matrices with n ones, distinct up to cyclic shifts of rows and/or columns; reflection through any vertical or horizontal axis; and reflection through the main diagonal. Also number of quasi-n-ominoes on a torus divided into a 6 X 6 grid.A093469
Number of 6 X 6 binary matrices with n ones, distinct up to cyclic shifts of rows and/or columns; reflection through any vertical or horizontal axis; and reflection through the main diagonal. Also number of quasi-n-ominoes on a torus divided into a 6 X 6 grid.
- a(n) = floor(n^(1/n)*10^n).A093470
a(n) = floor(n^(1/n)*10^n).
- a(n) = floor(n^(1/2)*10^n).A093471
a(n) = floor(n^(1/2)*10^n).
- (2n+1)-digit anti-palindromic numbers or numberdromes, whose first and last digits add to ten, second and next-to-last add to ten and so on with the central digit a 5.A093472
(2n+1)-digit anti-palindromic numbers or numberdromes, whose first and last digits add to ten, second and next-to-last add to ten and so on with the central digit a 5.
- a(n) = the next n digits of phi, the golden ratio.A093473
a(n) = the next n digits of phi, the golden ratio.
- Duplicate of A030101.A093474
Duplicate of A030101.
- Beginning with 1, numbers such that no term can arise as a substring of the right concatenation of any combination of the previous terms.A093475
Beginning with 1, numbers such that no term can arise as a substring of the right concatenation of any combination of the previous terms.
- Index of occurrence of the first 0 bit in binary representation of 3^n.A093476
Index of occurrence of the first 0 bit in binary representation of 3^n.
- Erroneous version of A086547.A093477
Erroneous version of A086547.
- Number of regular (finite but not necessarily convex) polytopes of full rank in n-dimensional space, or -1 if the number is infinite.A093478
Number of regular (finite but not necessarily convex) polytopes of full rank in n-dimensional space, or -1 if the number is infinite.
- Number of regular (infinite) apeirotopes of full rank in n-dimensional space.A093479
Number of regular (infinite) apeirotopes of full rank in n-dimensional space.
- Numbers k such that k^3 - (k-1)^2 is prime.A093480
Numbers k such that k^3 - (k-1)^2 is prime.
- Least k such that (2n + k) + 1 and (2n*k) + 1 are both primes.A093481
Least k such that (2n + k) + 1 and (2n*k) + 1 are both primes.
- a(n) = the least positive k such that (n+k)+1 and (n*k)+1 are both squares; or 0 if no such k exists.A093482
a(n) = the least positive k such that (n+k)+1 and (n*k)+1 are both squares; or 0 if no such k exists.
- a(1) = 2; for n>1, a(n) = smallest integer > a(n-1) such that a(n) + a(i) + 1 is prime for all 1 <= i <= n-1.A093483
a(1) = 2; for n>1, a(n) = smallest integer > a(n-1) such that a(n) + a(i) + 1 is prime for all 1 <= i <= n-1.
- Beginning with 2, a(n+1) is obtained as the least prime of the form a(n)*(m)*(m+1)*(m+2)...(m+k) +1 where a(n) was obtained as the least prime of the form a(n-1)*(r)*(r+1)*(r+2)...(m-1) +1 and so on.A093484
Beginning with 2, a(n+1) is obtained as the least prime of the form a(n)*(m)*(m+1)*(m+2)...(m+k) +1 where a(n) was obtained as the least prime of the form a(n-1)*(r)*(r+1)*(r+2)...(m-1) +1 and so on.
- a(n) = (27*n^2 + 9*n + 2)/2.A093485
a(n) = (27*n^2 + 9*n + 2)/2.
- Least k >= 0 such that k! + n is a square, or -1 if no such number exists.A093486
Least k >= 0 such that k! + n is a square, or -1 if no such number exists.
- Smallest prime that begins with the digit reversal of prime(n).A093487
Smallest prime that begins with the digit reversal of prime(n).
- Define the signature symmetry of a number n to be k if n-r and n+r have the same prime signature for r = 1 to k but not for k+1. Sequence contains the signature symmetry of n.A093488
Define the signature symmetry of a number n to be k if n-r and n+r have the same prime signature for r = 1 to k but not for k+1. Sequence contains the signature symmetry of n.
- Define the total signature symmetry of a number n to be the number of values r takes such that n-r and n+r have the same prime signature. Sequence contains the total signature symmetry of n.A093489
Define the total signature symmetry of a number n to be the number of values r takes such that n-r and n+r have the same prime signature. Sequence contains the total signature symmetry of n.
- a(0) = 2; for n > 0, a(n) is the least prime of the form k*n*a(n-1) - 1.A093490
a(0) = 2; for n > 0, a(n) is the least prime of the form k*n*a(n-1) - 1.
- Index of the first occurrence of n in A093489.A093491
Index of the first occurrence of n in A093489.
- Define the divisor symmetry of a number n to be k if n-r and n+r have the same number of divisors for r = 1 to k but not for k+1. Sequence contains the divisor symmetry of n.A093492
Define the divisor symmetry of a number n to be k if n-r and n+r have the same number of divisors for r = 1 to k but not for k+1. Sequence contains the divisor symmetry of n.
- Define the total divisor symmetry of a number n to be the number of values r takes such that n-r and n+r have the same number of divisors. Sequence contains the total divisor symmetry of n.A093493
Define the total divisor symmetry of a number n to be the number of values r takes such that n-r and n+r have the same number of divisors. Sequence contains the total divisor symmetry of n.
- Index of the first occurrence of n in A093493.A093494
Index of the first occurrence of n in A093493.
- Erroneous version of A093496.A093495
Erroneous version of A093496.
- Least k such that for every 1 < r < n there exists a distinct s, n < s <= k so that r and s have the same prime signature.A093496
Least k such that for every 1 < r < n there exists a distinct s, n < s <= k so that r and s have the same prime signature.
- Beginning with 6, numbers such that every partial concatenation has the same prime signature p*q.A093497
Beginning with 6, numbers such that every partial concatenation has the same prime signature p*q.
- Beginning with 1, distinct numbers such that the arithmetic mean of even number of successive terms and the geometric mean of the odd number of successive terms including the first term are integers.A093498
Beginning with 1, distinct numbers such that the arithmetic mean of even number of successive terms and the geometric mean of the odd number of successive terms including the first term are integers.
- Means referred to in A093498.A093499
Means referred to in A093498.
- a(n) = (15*n^2 + 5*n + 2)/2.A093500
a(n) = (15*n^2 + 5*n + 2)/2.
- Numbers whose digit permutations are all squarefree numbers.A093501
Numbers whose digit permutations are all squarefree numbers.
- a(1) = 2; for n > 0, a(n+1) is the a(n)-th prime after a(n).A093502
a(1) = 2; for n > 0, a(n+1) is the a(n)-th prime after a(n).
- a(0) = 2, a(n) = least prime >= a(n-1) + n.A093503
a(0) = 2, a(n) = least prime >= a(n-1) + n.
- A093503(k) is a term if A093503(k) and A093503(k+1) are successive primes.A093504
A093503(k) is a term if A093503(k) and A093503(k+1) are successive primes.
- a(n) = floor(A001969(n)/2 + 1/2).A093505
a(n) = floor(A001969(n)/2 + 1/2).
- Variation on Golomb's sequence starting with (1,2): a(n)=length of n-th run of consecutive integers with same parity.A093506
Variation on Golomb's sequence starting with (1,2): a(n)=length of n-th run of consecutive integers with same parity.
- Perimeter of primitive Pythagorean triangles sorted on hypotenuse A020882(n).A093507
Perimeter of primitive Pythagorean triangles sorted on hypotenuse A020882(n).
- Semiperimeter of primitive Pythagorean triangles sorted on hypotenuse A020882(n).A093508
Semiperimeter of primitive Pythagorean triangles sorted on hypotenuse A020882(n).
- Multiples of 5 or 6.A093509
Multiples of 5 or 6.
- Transform of the prime sequence by the Rule30 cellular automaton.A093510
Transform of the prime sequence by the Rule30 cellular automaton.