Sequences
392,541 sequences
- Palindromes arising in A083457.A083461
Palindromes arising in A083457.
- Smallest palindrome k such that k - n is a distinct power of 2; i.e., a power of 2 that has not arisen earlier.A083462
Smallest palindrome k such that k - n is a distinct power of 2; i.e., a power of 2 that has not arisen earlier.
- a(n) = smallest number k such that 2^n + k is a palindrome.A083463
a(n) = smallest number k such that 2^n + k is a palindrome.
- Triangle read by rows in which row n contains the n smallest palindromes == 1 mod n and > 1.A083464
Triangle read by rows in which row n contains the n smallest palindromes == 1 mod n and > 1.
- Diagonal of A083464.A083465
Diagonal of A083464.
- Smallest nontrivial multiple of n ending in n. By nontrivial one means a(n) is not equal to n or concatenation of n with itself.A083466
Smallest nontrivial multiple of n ending in n. By nontrivial one means a(n) is not equal to n or concatenation of n with itself.
- Duplicate of A061807.A083467
Duplicate of A061807.
- Smallest multiple of n which is the reverse concatenation of n consecutive numbers; or 0 if no such number exists.A083468
Smallest multiple of n which is the reverse concatenation of n consecutive numbers; or 0 if no such number exists.
- Smallest k such that n*k is a reverse concatenation of n consecutive natural numbers.A083469
Smallest k such that n*k is a reverse concatenation of n consecutive natural numbers.
- Smallest prime which is the concatenation of n distinct primes in increasing order.A083470
Smallest prime which is the concatenation of n distinct primes in increasing order.
- Smallest prime which is a reverse concatenation of n consecutive primes.A083471
Smallest prime which is a reverse concatenation of n consecutive primes.
- Smallest prime p such that the backward concatenation of n consecutive decreasing primes starting with p is a prime.A083472
Smallest prime p such that the backward concatenation of n consecutive decreasing primes starting with p is a prime.
- Erroneous version of A061372.A083473
Erroneous version of A061372.
- a(n) = T(n)^2-n!, where T(n) is the n-th triangular number.A083474
a(n) = T(n)^2-n!, where T(n) is the n-th triangular number.
- Consider the set of all the numbers n*k where 1 <= k <= n. Then a(n) = number of palindromic members of this set.A083475
Consider the set of all the numbers n*k where 1 <= k <= n. Then a(n) = number of palindromic members of this set.
- Positions of 0's in A083475.A083476
Positions of 0's in A083475.
- Smallest palindrome > 1 and == 1 (mod n-th palindrome).A083477
Smallest palindrome > 1 and == 1 (mod n-th palindrome).
- a(n) is the smallest k > 0 such that k*Palindrome(n)+1 is a palindrome.A083478
a(n) is the smallest k > 0 such that k*Palindrome(n)+1 is a palindrome.
- The natural numbers with all terms of A033638 inserted.A083479
The natural numbers with all terms of A033638 inserted.
- Compress the triangular array A049597 by suppressing zero entries and reversing the order of each row.A083480
Compress the triangular array A049597 by suppressing zero entries and reversing the order of each row.
- Squarefree part of the n-th oblong number.A083481
Squarefree part of the n-th oblong number.
- Square root of smallest square of the type n(n+1)*k.A083482
Square root of smallest square of the type n(n+1)*k.
- Number of forests with two connected components in the complete graph K_{n}.A083483
Number of forests with two connected components in the complete graph K_{n}.
- Square root of product of terms in row n of A083486.A083484
Square root of product of terms in row n of A083486.
- Diagonal of A083486.A083485
Diagonal of A083486.
- Triangle read by rows in which the n-th row contains the smallest set of n increasing numbers beginning with n with a product which is a square.A083486
Triangle read by rows in which the n-th row contains the smallest set of n increasing numbers beginning with n with a product which is a square.
- Triangle read by rows: T(n,k) = 2*n*k + n + k (1 <= k <= n).A083487
Triangle read by rows: T(n,k) = 2*n*k + n + k (1 <= k <= n).
- Weight distribution of [127,99,9] primitive binary BCH code.A083488
Weight distribution of [127,99,9] primitive binary BCH code.
- Triangle read by rows where the n-th row gives the reverse-lexicographically earliest sequence of n distinct integers > 1 whose product equals the smallest possible square (=A081456(n)).A083489
Triangle read by rows where the n-th row gives the reverse-lexicographically earliest sequence of n distinct integers > 1 whose product equals the smallest possible square (=A081456(n)).
- Multiples of 2 in which there is no common digit in successive terms.A083490
Multiples of 2 in which there is no common digit in successive terms.
- Multiples of 3 in which there is no common digit in successive terms.A083491
Multiples of 3 in which there is no common digit in successive terms.
- Multiples of 4 in which there is no common digit in successive terms.A083492
Multiples of 4 in which there is no common digit in successive terms.
- Multiples of 5 in which there is no common digit in successive terms.A083493
Multiples of 5 in which there is no common digit in successive terms.
- Multiples of 6 in which there is no common digit in successive terms.A083494
Multiples of 6 in which there is no common digit in successive terms.
- Multiples of 7 in which there is no common digit in successive terms.A083495
Multiples of 7 in which there is no common digit in successive terms.
- Multiples of 8 in which there is no common digit in successive terms.A083496
Multiples of 8 in which there is no common digit in successive terms.
- Multiples of 9 in which there is no common digit in successive terms.A083497
Multiples of 9 in which there is no common digit in successive terms.
- a(n)= smallest multiple of n greater than n which has no digit in common with a(n-1).A083498
a(n)= smallest multiple of n greater than n which has no digit in common with a(n-1).
- a(n) = A083498(n)/n.A083499
a(n) = A083498(n)/n.
- Smallest k such that n*(n+k) + 1 is a cube.A083500
Smallest k such that n*(n+k) + 1 is a cube.
- Cube roots arising in A083500.A083501
Cube roots arising in A083500.
- Smallest k such that n*(n+k) + 1 is an n-th power.A083502
Smallest k such that n*(n+k) + 1 is an n-th power.
- Basis of the n-th power arising in A083502.A083503
Basis of the n-th power arising in A083502.
- Triangle read by rows: for 1 <= k <= n, T(n, k) is the total perimeter of all squares contained in a square grid with n rows and k columns.A083504
Triangle read by rows: for 1 <= k <= n, T(n, k) is the total perimeter of all squares contained in a square grid with n rows and k columns.
- Erroneous version of A027428.A083505
Erroneous version of A027428.
- n-th row of the following triangle contains all distinct numbers that can be obtained as the product of two distinct numbers chosen from 1 to n. (n>1). Sequence contains the triangle read by rows.A083506
n-th row of the following triangle contains all distinct numbers that can be obtained as the product of two distinct numbers chosen from 1 to n. (n>1). Sequence contains the triangle read by rows.
- n-th row of the following triangle contains all distinct numbers that can be obtained as the product of three distinct numbers chosen from 1 to n (for n>2). Sequence contains the triangle read by rows.A083507
n-th row of the following triangle contains all distinct numbers that can be obtained as the product of three distinct numbers chosen from 1 to n (for n>2). Sequence contains the triangle read by rows.
- Number of distinct products i*j*k with 1 <= i < j <= k <= n and j < n.A083508
Number of distinct products i*j*k with 1 <= i < j <= k <= n and j < n.
- Friedman numbers that involve the "^" sign.A083509
Friedman numbers that involve the "^" sign.
- Members of A000124 which are the arithmetic mean of two other members.A083510
Members of A000124 which are the arithmetic mean of two other members.