Sequences
392,541 sequences
- Digit reversal of 11*n, divided by 11.A084011
Digit reversal of 11*n, divided by 11.
- Duplicate of A062919.A084012
Duplicate of A062919.
- Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.A084013
Smallest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.
- A084013(n)/n.A084014
A084013(n)/n.
- Largest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.A084015
Largest n-digit palindromic multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.
- A084015(n)/n.A084016
A084015(n)/n.
- Smallest n-digit palindromic multiple of n with a digit sum that is also a multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.A084017
Smallest n-digit palindromic multiple of n with a digit sum that is also a multiple of n. For n = 10k it is sufficient that the multiple is palindromic with leading zeros ignored. 0 if no such number exists.
- A084017(n)/n.A084018
A084017(n)/n.
- a(n) = 9's complement of n-th palindrome (A002113).A084019
a(n) = 9's complement of n-th palindrome (A002113).
- Numbers which are either a divisor or a multiple of their 9's complement.A084020
Numbers which are either a divisor or a multiple of their 9's complement.
- Product of n and its 9's complement.A084021
Product of n and its 9's complement.
- Largest n-digit palindromic multiple of n with a digit sum that is also a multiple of n, or 0 if no such number exists. For n a multiple of 10 it is sufficient that a(n) be palindromic when trailing zeros are ignored.A084022
Largest n-digit palindromic multiple of n with a digit sum that is also a multiple of n, or 0 if no such number exists. For n a multiple of 10 it is sufficient that a(n) be palindromic when trailing zeros are ignored.
- a(n) = A084022(n)/n.A084023
a(n) = A084022(n)/n.
- Triangle read by rows in which row n gives n smallest n-digit multiples of n that are palindromes.A084024
Triangle read by rows in which row n gives n smallest n-digit multiples of n that are palindromes.
- Divide n-th row of A084024 by n.A084025
Divide n-th row of A084024 by n.
- Diagonal of A084024.A084026
Diagonal of A084024.
- Row sums in A084024.A084027
Row sums in A084024.
- Average of n-th row of A084024.A084028
Average of n-th row of A084024.
- Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.A084029
Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.
- Main diagonal of triangle A084029.A084030
Main diagonal of triangle A084029.
- Arithmetic means of the rows of triangle A084029.A084031
Arithmetic means of the rows of triangle A084029.
- Row sums of triangle A084029.A084032
Row sums of triangle A084029.
- Triangle read by rows: T(n, k) = A084029(n, k)/n.A084033
Triangle read by rows: T(n, k) = A084029(n, k)/n.
- Numbers which are a product of repeated-digit numbers A010785.A084034
Numbers which are a product of repeated-digit numbers A010785.
- a(1) = 1 and then distinct numbers such that the sum as well the absolute difference of successive terms is a prime.A084035
a(1) = 1 and then distinct numbers such that the sum as well the absolute difference of successive terms is a prime.
- Duplicate of A092117.A084036
Duplicate of A092117.
- Primes obtained as the sum of two successive terms of A084035.A084037
Primes obtained as the sum of two successive terms of A084035.
- Primes obtained as the absolute difference of two successive terms of A084035.A084038
Primes obtained as the absolute difference of two successive terms of A084035.
- a(1) = 1; then distinct numbers such that both the product of two successive terms + 1 and the ratio of the larger to the smaller of two successive terms + 1 is a prime.A084039
a(1) = 1; then distinct numbers such that both the product of two successive terms + 1 and the ratio of the larger to the smaller of two successive terms + 1 is a prime.
- Primes obtained as the product of successive terms of A084039 + 1, i.e., a(n) = A084039(n)*A084039(n+1) + 1.A084040
Primes obtained as the product of successive terms of A084039 + 1, i.e., a(n) = A084039(n)*A084039(n+1) + 1.
- Primes obtained as the ratio of successive terms of A084039 + 1; i.e., a(n) = max(A084039(n), A084039(n+1))/min(A084039(n), A084039(n+1)) + 1.A084041
Primes obtained as the ratio of successive terms of A084039 + 1; i.e., a(n) = max(A084039(n), A084039(n+1))/min(A084039(n), A084039(n+1)) + 1.
- Smallest multiple of n in which the digit string of n appears sandwiched between at least a pair of digits.A084042
Smallest multiple of n in which the digit string of n appears sandwiched between at least a pair of digits.
- Smallest palindromic multiple of n in which the digit string of n appears as sandwiched between at least a pair of digits, or 0 if n = 10k or no such number exists.A084043
Smallest palindromic multiple of n in which the digit string of n appears as sandwiched between at least a pair of digits, or 0 if n = 10k or no such number exists.
- Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.A084044
Smallest palindromic multiple of n in which n is a substring (anywhere), or 0 if n = 10k or no such number exists.
- Duplicate of A083982.A084045
Duplicate of A083982.
- Smallest prime p such that p + n is an n-th power, or 0 if no such number exists. I.e., smallest prime of the form k^n - n.A084046
Smallest prime p such that p + n is an n-th power, or 0 if no such number exists. I.e., smallest prime of the form k^n - n.
- Smallest prime p such that p - n is an n-th power, or 0 if no such number exists; i.e., smallest prime of the form k^n + n.A084047
Smallest prime p such that p - n is an n-th power, or 0 if no such number exists; i.e., smallest prime of the form k^n + n.
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.A084048
Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.
- Numbers k such that k and k+1 have the same sum of digits of divisors; A034690(k) = A034690(k+1).A084049
Numbers k such that k and k+1 have the same sum of digits of divisors; A034690(k) = A034690(k+1).
- Numbers n such that at least one permutation of the digits of n yields a palindrome.A084050
Numbers n such that at least one permutation of the digits of n yields a palindrome.
- Smallest palindrome corresponding to A084050(n).A084051
Smallest palindrome corresponding to A084050(n).
- 2*n digit-reversed mod 2.A084052
2*n digit-reversed mod 2.
- 4*n digit-reversed mod 4.A084053
4*n digit-reversed mod 4.
- 5*n digit-reversed mod 5.A084054
5*n digit-reversed mod 5.
- 6*n digit-reversed mod 6.A084055
6*n digit-reversed mod 6.
- a(n) = -a(n-1) + a(n-2) + a(n-3), with a(0)=0, a(1)=1, a(2)=-3.A084056
a(n) = -a(n-1) + a(n-2) + a(n-3), with a(0)=0, a(1)=1, a(2)=-3.
- a(n) = 2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=1.A084057
a(n) = 2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=1.
- a(n) = 2*a(n-1) + 7*a(n-2) for n>1, a(0)=1, a(1)=1.A084058
a(n) = 2*a(n-1) + 7*a(n-2) for n>1, a(0)=1, a(1)=1.
- a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=1, a(1)=2.A084059
a(n) = 4*a(n-1) + 2*a(n-2) for n>1, a(0)=1, a(1)=2.
- a(n) = 1/2 + (1-6*n)*(-1)^n/2.A084060
a(n) = 1/2 + (1-6*n)*(-1)^n/2.