Sequences
392,541 sequences
- Hypotenuses of primitive Pythagorean triangles with an odd short leg (or an even long leg) sorted on semiperimeter.A081961
Hypotenuses of primitive Pythagorean triangles with an odd short leg (or an even long leg) sorted on semiperimeter.
- Ordered semiperimeters of primitive Pythagorean triangles with an even short leg (or an odd long leg).A081962
Ordered semiperimeters of primitive Pythagorean triangles with an even short leg (or an odd long leg).
- Even short legs of primitive Pythagorean triangles sorted on semiperimeter.A081963
Even short legs of primitive Pythagorean triangles sorted on semiperimeter.
- In the following triangle the n-th row contains n numbers relatively prime to n and not occurring in a previous row. a(1) = 1. Sequence contains the triangle by rows.A081964
In the following triangle the n-th row contains n numbers relatively prime to n and not occurring in a previous row. a(1) = 1. Sequence contains the triangle by rows.
- Diagonal of A081964.A081965
Diagonal of A081964.
- Row sums of A081964.A081966
Row sums of A081964.
- Duplicate of A076099.A081967
Duplicate of A076099.
- Duplicate of A076096.A081968
Duplicate of A076096.
- Duplicate of A076097.A081969
Duplicate of A076097.
- Duplicate of A076098.A081970
Duplicate of A076098.
- Consider the harmonic progression 1,1/2,1/3,1/4,1/5,..., group the terms such that the n-th group contains n members like this (1/1),(1/2,1/3),(1/4,1/5,1/6), (1/7,1/8,1/9,1/10),... a(n) = the numerator of the reduced rational sum of the terms of the n-th group.A081971
Consider the harmonic progression 1,1/2,1/3,1/4,1/5,..., group the terms such that the n-th group contains n members like this (1/1),(1/2,1/3),(1/4,1/5,1/6), (1/7,1/8,1/9,1/10),... a(n) = the numerator of the reduced rational sum of the terms of the n-th group.
- Consider the geometric progression 1,1/2,1/4,1/8,1/16,1/32,1/64,... Group the terms such that the n-th group contains n terms like this (1/1),(1/2,1/4),(1/8,1/16,1,32),(1/64,1/128,1/256,1/512),... a(n) = floor(1/s(n)) where s(n) is the sum of the members of the n-th group.A081972
Consider the geometric progression 1,1/2,1/4,1/8,1/16,1/32,1/64,... Group the terms such that the n-th group contains n terms like this (1/1),(1/2,1/4),(1/8,1/16,1,32),(1/64,1/128,1/256,1/512),... a(n) = floor(1/s(n)) where s(n) is the sum of the members of the n-th group.
- a(1) = 1; a(n) = a(n-1) + sigma(a(n-1)) where sigma(k) = sum of the divisors of k.A081973
a(1) = 1; a(n) = a(n-1) + sigma(a(n-1)) where sigma(k) = sum of the divisors of k.
- a(1) = 1 and smallest number not occurring earlier such that the product of two neighboring terms is a distinct triangular number, where "distinct" means that a(n)*a(n+1) may not equal the product of any two previous consecutive terms.A081974
a(1) = 1 and smallest number not occurring earlier such that the product of two neighboring terms is a distinct triangular number, where "distinct" means that a(n)*a(n+1) may not equal the product of any two previous consecutive terms.
- Triangular number pertaining to A081974. a(n) = A081974(n)*A081974(n+1).A081975
Triangular number pertaining to A081974. a(n) = A081974(n)*A081974(n+1).
- For n > 2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers.A081976
For n > 2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers.
- Odd long legs of primitive Pythagorean triangles sorted on semiperimeter.A081977
Odd long legs of primitive Pythagorean triangles sorted on semiperimeter.
- Smallest triangular number with exactly n divisors, or 0 if no such number exists.A081978
Smallest triangular number with exactly n divisors, or 0 if no such number exists.
- Smallest Fibonacci number with 2n divisors, or 0 if no such number exists.A081979
Smallest Fibonacci number with 2n divisors, or 0 if no such number exists.
- a(n) = numerator of the sum of the reciprocals of the n primes from prime(n(n-1)/2+1) to prime(n(n+1)/2).A081980
a(n) = numerator of the sum of the reciprocals of the n primes from prime(n(n-1)/2+1) to prime(n(n+1)/2).
- Primes p such that p+1 is divisible by every nonzero digit of p.A081981
Primes p such that p+1 is divisible by every nonzero digit of p.
- Primes p such that p+1 is divisible by the digital product (of nonzero digits) of p.A081982
Primes p such that p+1 is divisible by the digital product (of nonzero digits) of p.
- Primes p such that p-1 is divisible by every nonzero digit of p.A081983
Primes p such that p-1 is divisible by every nonzero digit of p.
- Primes p such that p-1 is divisible by the digital product ( of nonzero digits) of p.A081984
Primes p such that p-1 is divisible by the digital product ( of nonzero digits) of p.
- Hypotenuses of primitive Pythagorean triangles with even short leg (or odd long leg) sorted on semiperimeter.A081985
Hypotenuses of primitive Pythagorean triangles with even short leg (or odd long leg) sorted on semiperimeter.
- a(n) = {A081984(n)-1}/d, where d is the product of nonzero digits of A081984(n).A081986
a(n) = {A081984(n)-1}/d, where d is the product of nonzero digits of A081984(n).
- a(n) = {A081982(n)+1}/d, where d is the product of nonzero digits of A081982(n).A081987
a(n) = {A081982(n)+1}/d, where d is the product of nonzero digits of A081982(n).
- Product of digits + 1 is a prime.A081988
Product of digits + 1 is a prime.
- Numbers k such that 1 + product of digits of k is a square greater than 1.A081989
Numbers k such that 1 + product of digits of k is a square greater than 1.
- Numbers k that have no zero digits and such that both k+1 and (product of digits of k) + 1 are squares.A081990
Numbers k that have no zero digits and such that both k+1 and (product of digits of k) + 1 are squares.
- Numbers in ascending order formed by using all the digits of the next n numbers.A081991
Numbers in ascending order formed by using all the digits of the next n numbers.
- a(n) = count of numbers formed using the digits of next n numbers.A081992
a(n) = count of numbers formed using the digits of next n numbers.
- a(n) = sum of numbers formed using the digits of next n numbers.A081993
a(n) = sum of numbers formed using the digits of next n numbers.
- Triangle read by rows in which the n-th row contains n numbers not occurring earlier such that every entry is coprime to all the members of the row and column it belongs.A081994
Triangle read by rows in which the n-th row contains n numbers not occurring earlier such that every entry is coprime to all the members of the row and column it belongs.
- Diagonal of triangle A081994.A081995
Diagonal of triangle A081994.
- First column of triangle A081994.A081996
First column of triangle A081994.
- Row sums in triangle A081994.A081997
Row sums in triangle A081994.
- Square array read by antidiagonals, alternating upwards and downwards: T(i, j) is the least number that is greater than the previous term and coprime to every number on the same row or column.A081998
Square array read by antidiagonals, alternating upwards and downwards: T(i, j) is the least number that is greater than the previous term and coprime to every number on the same row or column.
- First row of array in A081998.A081999
First row of array in A081998.
- First column of array in A081998.A082000
First column of array in A081998.
- Sum of n-th antidiagonal of array in A081998.A082001
Sum of n-th antidiagonal of array in A081998.
- Square array read by antidiagonals, alternating upwards and downwards: T(1, 1) = 1 and every other entry is the smallest number not already used that has a common factor with every number in its row and column, not including the 1.A082002
Square array read by antidiagonals, alternating upwards and downwards: T(1, 1) = 1 and every other entry is the smallest number not already used that has a common factor with every number in its row and column, not including the 1.
- First row of array in A082002.A082003
First row of array in A082002.
- First column of array in A082002.A082004
First column of array in A082002.
- Sum of n-th antidiagonal of array in A082002.A082005
Sum of n-th antidiagonal of array in A082002.
- In the following square array numbers (not occurring earlier) are entered like this: a(1, 1), a(1, 2), a(2, 1), a(3, 1), a(2, 2), a(1, 3), a(1, 4), a(2, 3), a(3, 2), a(4, 1), a(5, 1), a(4, 2), ... such that every entry is coprime to the members of the row and column it belongs, with the condition that the n-th diagonal sum is a multiple of n. 1 2 7 9 31 25... 4 5 11 23 27... 3 13 8... 19 21... 17 ... ... Sequence contains numbers as they are entered.A082006
In the following square array numbers (not occurring earlier) are entered like this: a(1, 1), a(1, 2), a(2, 1), a(3, 1), a(2, 2), a(1, 3), a(1, 4), a(2, 3), a(3, 2), a(4, 1), a(5, 1), a(4, 2), ... such that every entry is coprime to the members of the row and column it belongs, with the condition that the n-th diagonal sum is a multiple of n. 1 2 7 9 31 25... 4 5 11 23 27... 3 13 8... 19 21... 17 ... ... Sequence contains numbers as they are entered.
- Triangle (an infinite binary tree) read by rows; see Comments lines for definition.A082007
Triangle (an infinite binary tree) read by rows; see Comments lines for definition.
- a(n) = A082007(n-1) + 1.A082008
a(n) = A082007(n-1) + 1.
- a(n) is the label of parent node of node n in tree shown in A082007.A082009
a(n) is the label of parent node of node n in tree shown in A082007.
- a(n) = n/2 if n is even, otherwise floor(8*n/5)+1.A082010
a(n) = n/2 if n is even, otherwise floor(8*n/5)+1.