Sequences
392,541 sequences
- Numbers k such that prime(k)+1 divides k^2.A062061
Numbers k such that prime(k)+1 divides k^2.
- Smallest increasing sequence where each term is coprime to preceding three terms.A062062
Smallest increasing sequence where each term is coprime to preceding three terms.
- a(n) is the smallest number greater than a(n-1) that is coprime to the last four terms of the sequence, with a(1) = 1, a(2) = 2, a(3) = 3, and a(4) = 5.A062063
a(n) is the smallest number greater than a(n-1) that is coprime to the last four terms of the sequence, with a(1) = 1, a(2) = 2, a(3) = 3, and a(4) = 5.
- a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a square.A062064
a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a square.
- a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed).A062065
a(1) = 1; for n >= 1, a(n+1) is smallest number such that the sums of any one, two or three of a(1), ..., a(n) are distinct (repetitions not allowed).
- a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a cube.A062066
a(1) = 2; a(n) is the smallest prime > a(n-1) such that a(n) + a(n-1) is a cube.
- a(1) = 1; a(n) is smallest square > a(n-1) such that a(n) + a(n-1) is a prime.A062067
a(1) = 1; a(n) is smallest square > a(n-1) such that a(n) + a(n-1) is a prime.
- a(n) = d(sigma(n)), where d(k) is the number of divisors function (A000005) and sigma(k) is the sum of divisor function (A000203).A062068
a(n) = d(sigma(n)), where d(k) is the number of divisors function (A000005) and sigma(k) is the sum of divisor function (A000203).
- a(n) = sigma(d(n)), where d(k) is the number of divisors function (A000005) and sigma(k) is the sum of divisors function (A000203).A062069
a(n) = sigma(d(n)), where d(k) is the number of divisors function (A000005) and sigma(k) is the sum of divisors function (A000203).
- Smallest base b such that the decimal digits of n interpreted as digits in base b give a square, or 0 if no such base exists.A062070
Smallest base b such that the decimal digits of n interpreted as digits in base b give a square, or 0 if no such base exists.
- a(n) = [n/1] + [n/(2^2)] + [n/(3^3)] + [n/(4^4)] + ... + [n/(k^k)] + ..., up to infinity, where [ ] is the floor function.A062071
a(n) = [n/1] + [n/(2^2)] + [n/(3^3)] + [n/(4^4)] + ... + [n/(k^k)] + ..., up to infinity, where [ ] is the floor function.
- Continued fraction expansion of Fibonacci factorial constant.A062072
Continued fraction expansion of Fibonacci factorial constant.
- Decimal expansion of Fibonacci factorial constant.A062073
Decimal expansion of Fibonacci factorial constant.
- a(n) = n^3 * 3^n.A062074
a(n) = n^3 * 3^n.
- a(n) = n^4 * 4^n.A062075
a(n) = n^4 * 4^n.
- a(n) = (2n-1)^n * n^(2n-1).A062076
a(n) = (2n-1)^n * n^(2n-1).
- a(n) = (2n)^n * n^(2n).A062077
a(n) = (2n)^n * n^(2n).
- LCM of the digits of n.A062078
LCM of the digits of n.
- Group the odd numbers as (1), (3,5), (7,9,11), (13,15,17,19), (21,23,25,27,29), ... then a(n) = LCM of the n-th group.A062079
Group the odd numbers as (1), (3,5), (7,9,11), (13,15,17,19), (21,23,25,27,29), ... then a(n) = LCM of the n-th group.
- Group the even numbers as 2, (4,6), (8,10,12), (14,16,18,20), (22,24,26,28,30), ... then a(n) = LCM of the n-th group.A062080
Group the even numbers as 2, (4,6), (8,10,12), (14,16,18,20), (22,24,26,28,30), ... then a(n) = LCM of the n-th group.
- Group the even numbers as (2,4), (6,8,10,12), (14,16,18,20,22,24), (26,28,30,32,34,36,38,40), ... then a(n) = LCM of the n-th group.A062081
Group the even numbers as (2,4), (6,8,10,12), (14,16,18,20,22,24), (26,28,30,32,34,36,38,40), ... then a(n) = LCM of the n-th group.
- a(n) = prime(n)^n * n^prime(n).A062082
a(n) = prime(n)^n * n^prime(n).
- Continued fraction expansion of Sierpiński's Constant.A062083
Continued fraction expansion of Sierpiński's Constant.
- Squarefree numbers such that every digit as well as sum of the digits is a squarefree number.A062084
Squarefree numbers such that every digit as well as sum of the digits is a squarefree number.
- Squarefree numbers with all even digits.A062085
Squarefree numbers with all even digits.
- Squarefree numbers with all odd digits.A062086
Squarefree numbers with all odd digits.
- Squarefree numbers with all prime digits.A062087
Squarefree numbers with all prime digits.
- Primes with every digit a prime and the sum of the digits a prime.A062088
Primes with every digit a prime and the sum of the digits a prime.
- Decimal expansion of Sierpiński's constant.A062089
Decimal expansion of Sierpiński's constant.
- a(1) = 1, a(n) = smallest odd number that does not divide the product of all previous terms.A062090
a(1) = 1, a(n) = smallest odd number that does not divide the product of all previous terms.
- a(1) = 2, a(n)= smallest even number which does not divide the product of all previous terms.A062091
a(1) = 2, a(n)= smallest even number which does not divide the product of all previous terms.
- a(n) = 2*a(n-1) - (-1)^n for n > 0, a(0)=2.A062092
a(n) = 2*a(n-1) - (-1)^n for n > 0, a(0)=2.
- Continued fraction expansion of constant defined in A054399.A062093
Continued fraction expansion of constant defined in A054399.
- a(1) = 2, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).A062094
a(1) = 2, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).
- a(1) = 1, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).A062095
a(1) = 1, a(n) = concatenation of two closest factors of a(n-1) whose product equals a(n-1) or if a(n-1) is a prime then the concatenation of 1 and a(n-1).
- a(1) = 2; for n > 1, a(n) is smallest number, greater than a(n-1), which is relatively prime to the sum of all previous terms.A062096
a(1) = 2; for n > 1, a(n) is smallest number, greater than a(n-1), which is relatively prime to the sum of all previous terms.
- a(1) = 1; a(n) = sum of the sum and the product of all previous terms.A062097
a(1) = 1; a(n) = sum of the sum and the product of all previous terms.
- a(n) = 7 * n!.A062098
a(n) = 7 * n!.
- Triangular numbers whose sum of digits is a triangular number.A062099
Triangular numbers whose sum of digits is a triangular number.
- Triangular numbers with every digit a triangular number.A062100
Triangular numbers with every digit a triangular number.
- Squarefree numbers with every digit a squarefree number.A062101
Squarefree numbers with every digit a squarefree number.
- Numbers n such that no substring is a triangular number.A062102
Numbers n such that no substring is a triangular number.
- Number of paths by which an unpromoted knight (keima) of Shogi can move to various squares on infinite board, if it starts from its origin square, the second leftmost square of the back rank.A062103
Number of paths by which an unpromoted knight (keima) of Shogi can move to various squares on infinite board, if it starts from its origin square, the second leftmost square of the back rank.
- Square array read by antidiagonals: number of ways a black pawn (starting at any square on the second rank) can (theoretically) end at various squares on an infinite chessboard.A062104
Square array read by antidiagonals: number of ways a black pawn (starting at any square on the second rank) can (theoretically) end at various squares on an infinite chessboard.
- Square array read by antidiagonals: number of ways a pawn-like piece (with the initial 2-step move forbidden and starting from any square on the back rank) can end at various squares on an infinite chessboard.A062105
Square array read by antidiagonals: number of ways a pawn-like piece (with the initial 2-step move forbidden and starting from any square on the back rank) can end at various squares on an infinite chessboard.
- Number of ways a black pawn (from any starting square on the second back rank) can (theoretically) end on the n-th square of the leftmost file counted from the back rank.A062106
Number of ways a black pawn (from any starting square on the second back rank) can (theoretically) end on the n-th square of the leftmost file counted from the back rank.
- Diagonal of table A062104.A062107
Diagonal of table A062104.
- a(n) = floor(n^(3/4)).A062108
a(n) = floor(n^(3/4)).
- Expansion of ((1-x)/(1-2*x))^4.A062109
Expansion of ((1-x)/(1-2*x))^4.
- A(n,k) is the coefficient of x^k in (1-x)^n/(1-2*x)^n for n, k >= 0; Table A read by descending antidiagonals.A062110
A(n,k) is the coefficient of x^k in (1-x)^n/(1-2*x)^n for n, k >= 0; Table A read by descending antidiagonals.