Sequences
392,541 sequences
- Numbers n such that 2n+1 is the digit reversal of n+1.A083811
Numbers n such that 2n+1 is the digit reversal of n+1.
- Numbers k such that 4*k-1 is the digit reversal of k-1.A083812
Numbers k such that 4*k-1 is the digit reversal of k-1.
- a(n) = 3*(10^n-1).A083813
a(n) = 3*(10^n-1).
- Duplicate of A073805.A083814
Duplicate of A073805.
- Semiprimes whose prime factors are distinct and the reversal of one factor is equal to the other.A083815
Semiprimes whose prime factors are distinct and the reversal of one factor is equal to the other.
- 10^n-th palindrome.A083816
10^n-th palindrome.
- Interleaving of (1,2,3,4,5,...), (2,2,2,2,...) and (0,1,3,6,10,...).A083817
Interleaving of (1,2,3,4,5,...), (2,2,2,2,...) and (0,1,3,6,10,...).
- Numbers k such that 2k-1 is the digit reversal of k.A083818
Numbers k such that 2k-1 is the digit reversal of k.
- a(1) = 1, then the smallest k > 1 such that nk + 1 is the digit reversal of k + 1, or 0 if no such number exists.A083819
a(1) = 1, then the smallest k > 1 such that nk + 1 is the digit reversal of k + 1, or 0 if no such number exists.
- Primes in which odd positioned digits are prime and even positioned digits are composite. The least significant digit is taken to be the first digit.A083820
Primes in which odd positioned digits are prime and even positioned digits are composite. The least significant digit is taken to be the first digit.
- Primes in which odd positioned digits are composite and even positioned digits are primes. The least significant digit is the taken to be the first digit.A083821
Primes in which odd positioned digits are composite and even positioned digits are primes. The least significant digit is the taken to be the first digit.
- a(n) = digit reversal of 3*n, divided by 3.A083822
a(n) = digit reversal of 3*n, divided by 3.
- a(1) = 15; then numbers obtained at every stage of division by 3 in the following process: multiply by 3, reverse the digits, divide by 3, reverse the digits, multiply by 3, reverse the digit, divide by 3.A083823
a(1) = 15; then numbers obtained at every stage of division by 3 in the following process: multiply by 3, reverse the digits, divide by 3, reverse the digits, multiply by 3, reverse the digit, divide by 3.
- a(n) = digit reversal of 9*n, divided by 9.A083824
a(n) = digit reversal of 9*n, divided by 9.
- a(1) = 12; then numbers obtained at every stage of division by 9 in the following process. multiply by 9, reverse the digits, divide by 9, reverse the digits, multiply by 9, reverse the digit, divide by 9, ...A083825
a(1) = 12; then numbers obtained at every stage of division by 9 in the following process. multiply by 9, reverse the digits, divide by 9, reverse the digits, multiply by 9, reverse the digit, divide by 9, ...
- Smallest k such that k+ 9*(A000042(n-1)*{n, mod 10) is digit reversal of k. A000042(n) = (10^n-1)/9.,a(10n) = 0.A083826
Smallest k such that k+ 9*(A000042(n-1)*{n, mod 10) is digit reversal of k. A000042(n) = (10^n-1)/9.,a(10n) = 0.
- Let x(n) = 123...n, y(n) = n...321; a(n) = y(n) concatenated with x(n) - x(n) concatenated with y(n).A083827
Let x(n) = 123...n, y(n) = n...321; a(n) = y(n) concatenated with x(n) - x(n) concatenated with y(n).
- Let x(n) = 123...n, y(n) = n...321; c(n) = delete the LSD of y(n) and concatenated with x(n); d(n) = delete LSD of x(n) and concatenate with y(n). a(n) = c(n) - d(n).A083828
Let x(n) = 123...n, y(n) = n...321; c(n) = delete the LSD of y(n) and concatenated with x(n); d(n) = delete LSD of x(n) and concatenate with y(n). a(n) = c(n) - d(n).
- Palindromes k such that 3k + 1 is also a palindrome.A083829
Palindromes k such that 3k + 1 is also a palindrome.
- Palindromes of the form 3n + 1 where n is also a palindrome: palindromes arising in A083829.A083830
Palindromes of the form 3n + 1 where n is also a palindrome: palindromes arising in A083829.
- Palindromes n such that 4n + 1 is also a palindrome.A083831
Palindromes n such that 4n + 1 is also a palindrome.
- Palindromes of the form 4n + 1 where n is also a palindrome. Palindromes arising in A083831.A083832
Palindromes of the form 4n + 1 where n is also a palindrome. Palindromes arising in A083831.
- Palindromes p such that 5p + 1 is also a palindrome.A083833
Palindromes p such that 5p + 1 is also a palindrome.
- Palindromes of the form 5p + 1 where p is also a palindrome. Palindromes arising in A083833.A083834
Palindromes of the form 5p + 1 where p is also a palindrome. Palindromes arising in A083833.
- Palindromes n such that 6n + 1 is also a palindrome.A083835
Palindromes n such that 6n + 1 is also a palindrome.
- Palindromes of the form 6n + 1 where n is also a palindrome. palindromes arising in A083835.A083836
Palindromes of the form 6n + 1 where n is also a palindrome. palindromes arising in A083835.
- Smallest palindrome n such that kn + 1 is a palindrome, or 0 if no such number exists.A083837
Smallest palindrome n such that kn + 1 is a palindrome, or 0 if no such number exists.
- Smallest palindrome of the form nk+1 where k is also a palindrome:, or 0 if no such number exists; palindromes arising in A083837.A083838
Smallest palindrome of the form nk+1 where k is also a palindrome:, or 0 if no such number exists; palindromes arising in A083837.
- G.f.: ( x - 3*x^2 + 6*x^3 - 8*x^4 + 4*x^5 - x^7 ) / (1 - 4*x + 6*x^2 - 5*x^3 + 2*x^4 + x^5 - x^6 + x^7 ).A083839
G.f.: ( x - 3*x^2 + 6*x^3 - 8*x^4 + 4*x^5 - x^7 ) / (1 - 4*x + 6*x^2 - 5*x^3 + 2*x^4 + x^5 - x^6 + x^7 ).
- Palindromic primes which are a member of a twin prime pair.A083840
Palindromic primes which are a member of a twin prime pair.
- Palindromic primes p such that p+2 is also a prime: members of A083840 which are the smaller member of a twin prime pair.A083841
Palindromic primes p such that p+2 is also a prime: members of A083840 which are the smaller member of a twin prime pair.
- Palindromic primes p such that p-2 is also a prime: members of A083840 which are the larger member of a twin prime pair.A083842
Palindromic primes p such that p-2 is also a prime: members of A083840 which are the larger member of a twin prime pair.
- Total number of distinct cycles in a particular cellular automata of size n.A083843
Total number of distinct cycles in a particular cellular automata of size n.
- Number of primes of the form x^2 + 1 < 10^n.A083844
Number of primes of the form x^2 + 1 < 10^n.
- a(n)^2 + 1 is largest prime of the form x^2 + 1 <= 10^n.A083845
a(n)^2 + 1 is largest prime of the form x^2 + 1 <= 10^n.
- a(n) is the largest prime of the form x^2 + 1 <= 10^n.A083846
a(n) is the largest prime of the form x^2 + 1 <= 10^n.
- a(n) = number of primes of the form x^2 + 1 <= 2^n.A083847
a(n) = number of primes of the form x^2 + 1 <= 2^n.
- a(n)^2 + 1 is largest prime of the form x^2 + 1 <= 2^n.A083848
a(n)^2 + 1 is largest prime of the form x^2 + 1 <= 2^n.
- a(n) is the largest prime of the form x^2 + 1 <= 2^n.A083849
a(n) is the largest prime of the form x^2 + 1 <= 2^n.
- Exponent of highest power of 11 dividing the n-th decimal palindrome; a(0) = 1.A083850
Exponent of highest power of 11 dividing the n-th decimal palindrome; a(0) = 1.
- Decimal palindromes that are not multiples of 11.A083851
Decimal palindromes that are not multiples of 11.
- Decimal palindromes that are multiples of 11.A083852
Decimal palindromes that are multiples of 11.
- Smallest nonnegative integer that can be written as a sum of Fibonacci numbers in n ways, counting 1 twice as Fibonacci number.A083853
Smallest nonnegative integer that can be written as a sum of Fibonacci numbers in n ways, counting 1 twice as Fibonacci number.
- Numbers that are squares, twice squares, three times squares, or six times squares, i.e., numbers whose squarefree part divides 6.A083854
Numbers that are squares, twice squares, three times squares, or six times squares, i.e., numbers whose squarefree part divides 6.
- Multiplicands in the list of numbers which are squares, twice squares, three times squares, or six times squares (A083854).A083855
Multiplicands in the list of numbers which are squares, twice squares, three times squares, or six times squares (A083854).
- Square array T(n,k) of generalized Fibonacci numbers, read by antidiagonals upwards (n, k >= 0).A083856
Square array T(n,k) of generalized Fibonacci numbers, read by antidiagonals upwards (n, k >= 0).
- Square array T(n,k) of binomial transforms of generalized Fibonacci numbers, read by ascending antidiagonals, with n, k >= 0.A083857
Square array T(n,k) of binomial transforms of generalized Fibonacci numbers, read by ascending antidiagonals, with n, k >= 0.
- Expansion of x/(1 - 3*x - 6*x^2).A083858
Expansion of x/(1 - 3*x - 6*x^2).
- Main diagonal of generalized Fibonacci array A083856.A083859
Main diagonal of generalized Fibonacci array A083856.
- First subdiagonal of generalized Fibonacci array A083856.A083860
First subdiagonal of generalized Fibonacci array A083856.