Sequences
392,541 sequences
- a(n) = n*(1+n^2)*((2+n^2)^2-n^2)/16.A094311
a(n) = n*(1+n^2)*((2+n^2)^2-n^2)/16.
- Beginning with 1, re-arrangement of natural numbers such that {a(2n-1)*a(2n)}^(1/2) and {a(2n)+a(2n+1)}/2 are integers.A094312
Beginning with 1, re-arrangement of natural numbers such that {a(2n-1)*a(2n)}^(1/2) and {a(2n)+a(2n+1)}/2 are integers.
- Geometric mean and arithmetic mean alternately of successive pair of terms of A094312.A094313
Geometric mean and arithmetic mean alternately of successive pair of terms of A094312.
- Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n).A094314
Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n).
- Triangle read by rows giving number of circular permutations of n letters such that all letters are displaced by no more than k places from their original position.A094315
Triangle read by rows giving number of circular permutations of n letters such that all letters are displaced by no more than k places from their original position.
- Primes p for which 2^j+p^j is also prime for j in {0,2,8,512}.A094316
Primes p for which 2^j+p^j is also prime for j in {0,2,8,512}.
- Primes with the property that the sum of the digits that are primes is prime.A094317
Primes with the property that the sum of the digits that are primes is prime.
- Primes n with property that sum of digits that are 1 or a prime is prime.A094318
Primes n with property that sum of digits that are 1 or a prime is prime.
- Prime values of Lehmer's polynomial 263*x^2+3.A094319
Prime values of Lehmer's polynomial 263*x^2+3.
- Numbers n >= 0 such that Lehmer's polynomial 263*n^2+3 is prime.A094320
Numbers n >= 0 such that Lehmer's polynomial 263*n^2+3 is prime.
- a(1) = 2. For n>1, let k = largest integer such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far. If k>1, a(n) = k. If k=1, choose a(n) so that the next k (that for a(1),...,a(n)) is as large as possible and if there is more than one choice for this a(n), pick the smallest.A094321
a(1) = 2. For n>1, let k = largest integer such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e., the maximal number of repeating blocks at the end of the sequence so far. If k>1, a(n) = k. If k=1, choose a(n) so that the next k (that for a(1),...,a(n)) is as large as possible and if there is more than one choice for this a(n), pick the smallest.
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k pyramids.A094322
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k pyramids.
- a(n) = n*(n+1)*(2n+1)*(3n+1)*(4n+1)/30.A094323
a(n) = n*(n+1)*(2n+1)*(3n+1)*(4n+1)/30.
- a(n) = 5 written in base n.A094324
a(n) = 5 written in base n.
- a(n) = 6 written in base n.A094325
a(n) = 6 written in base n.
- a(n) = 8 written in base n.A094326
a(n) = 8 written in base n.
- a(n) = 9 written in base n.A094327
a(n) = 9 written in base n.
- Iterate the map in A006369 starting at 4.A094328
Iterate the map in A006369 starting at 4.
- Iterate the map in A006369 starting at 16.A094329
Iterate the map in A006369 starting at 16.
- Product of next n numbers divided by n.A094330
Product of next n numbers divided by n.
- Least k such that n! < (n+1)(n+2)(n+3)...(n+k).A094331
Least k such that n! < (n+1)(n+2)(n+3)...(n+k).
- Iterate the map in A006368 starting at 12.A094332
Iterate the map in A006368 starting at 12.
- a(1) = 1, a(n) = least proper multiple of a(n-1) which is a concatenation of successive numbers. Terms with more than one digit must be a concatenation of at least two successive numbers.A094333
a(1) = 1, a(n) = least proper multiple of a(n-1) which is a concatenation of successive numbers. Terms with more than one digit must be a concatenation of at least two successive numbers.
- a(1) = 1, a(n) = least multiple of a(n-1) which is the reverse concatenation of successive numbers. Terms with more than one digit must be a concatenation of at least two successive numbers.A094334
a(1) = 1, a(n) = least multiple of a(n-1) which is the reverse concatenation of successive numbers. Terms with more than one digit must be a concatenation of at least two successive numbers.
- Largest right-truncatable prime number in base n if 1 is considered as a prime (written in base 10).A094335
Largest right-truncatable prime number in base n if 1 is considered as a prime (written in base 10).
- Product of next n numbers divided by the largest factorial divisor.A094336
Product of next n numbers divided by the largest factorial divisor.
- a(n) = floor((product of composites among next n numbers)/(product of primes among next n numbers)).A094337
a(n) = floor((product of composites among next n numbers)/(product of primes among next n numbers)).
- (Sum of composites among next n numbers)-(sum of primes among next n numbers).A094338
(Sum of composites among next n numbers)-(sum of primes among next n numbers).
- Beginning with 2, least number not occurring earlier that divides the sum of all previous terms.A094339
Beginning with 2, least number not occurring earlier that divides the sum of all previous terms.
- a(n) = n-th partial sum of A094339 divided by A094339(n+1).A094340
a(n) = n-th partial sum of A094339 divided by A094339(n+1).
- Index of the occurrence of n in A094339.A094341
Index of the occurrence of n in A094339.
- Successive record-setters for tau(n+1)*tau(n-1)/tau(n)^2, where tau(n) is the number of divisors of n.A094342
Successive record-setters for tau(n+1)*tau(n-1)/tau(n)^2, where tau(n) is the number of divisors of n.
- List of pairs of primes (p, q) with q - p = 4.A094343
List of pairs of primes (p, q) with q - p = 4.
- Triangle T(n,k), 0<= k <= n, read by rows; given by [0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, ...] DELTA [1, 0, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, ...] where DELTA is the operator defined in A084938.A094344
Triangle T(n,k), 0<= k <= n, read by rows; given by [0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, ...] DELTA [1, 0, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, ...] where DELTA is the operator defined in A084938.
- Sum of all digits in ternary expansions of 0, ..., n.A094345
Sum of all digits in ternary expansions of 0, ..., n.
- Another version of triangular array in A036970: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 2, 4, 6, 9, 12, 16, 20, 25, 30, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, ...] where DELTA is the operator defined in A084938.A094346
Another version of triangular array in A036970: triangle T(n,k), 0<=k<=n, read by rows; given by [0, 1, 2, 4, 6, 9, 12, 16, 20, 25, 30, ...] DELTA [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, ...] where DELTA is the operator defined in A084938.
- a(n) = 14*a(n-1) - a(n-2); a(0) = a(1) = 2.A094347
a(n) = 14*a(n-1) - a(n-2); a(0) = a(1) = 2.
- Numbers n such that, for some numbers (j,k), j<=k, n is the smallest positive multiple of j (or more) of the first k positive integers.A094348
Numbers n such that, for some numbers (j,k), j<=k, n is the smallest positive multiple of j (or more) of the first k positive integers.
- Numbers n such that A094291(n) is odd.A094349
Numbers n such that A094291(n) is odd.
- Numbers n such that A094291(n) is not a square.A094350
Numbers n such that A094291(n) is not a square.
- Rearrangement of integers such that a(0)!*a(1)!*...*a(n)! + 1 is prime.A094351
Rearrangement of integers such that a(0)!*a(1)!*...*a(n)! + 1 is prime.
- a(n) = b(0)!*b(1)!*...*b(n)! + 1 where b() = sequence A094351.A094352
a(n) = b(0)!*b(1)!*...*b(n)! + 1 where b() = sequence A094351.
- Smallest integer not yet used such that 1 + Product_{k=1..n} a(k) is a square.A094353
Smallest integer not yet used such that 1 + Product_{k=1..n} a(k) is a square.
- Squares arising as a partial product in A094353 + 1.A094354
Squares arising as a partial product in A094353 + 1.
- Duplicate of A087334.A094355
Duplicate of A087334.
- Duplicate of A087335.A094356
Duplicate of A087335.
- Numbers of the form k^2 -1 such that every partial product is also of the form k^2-1.A094357
Numbers of the form k^2 -1 such that every partial product is also of the form k^2-1.
- Squarefree products of factors of Fermat numbers (A023394).A094358
Squarefree products of factors of Fermat numbers (A023394).
- Pair reversal of a Jacobsthal sequence.A094359
Pair reversal of a Jacobsthal sequence.
- Pair reversal of Jacobsthal-Lucas numbers.A094360
Pair reversal of Jacobsthal-Lucas numbers.