Sequences
392,541 sequences
- a(n) = A083960(n)/A004151(n).A083961
a(n) = A083960(n)/A004151(n).
- Smallest palindromic multiple of n containing the digit string of a(n-1); or 0 if no such number exists.A083962
Smallest palindromic multiple of n containing the digit string of a(n-1); or 0 if no such number exists.
- a(n) = A083962(n)/n.A083963
a(n) = A083962(n)/n.
- Smallest palindromic multiple of 2n-1 beginning with the digit string of 2n-1; or 0 if no such number exists.A083964
Smallest palindromic multiple of 2n-1 beginning with the digit string of 2n-1; or 0 if no such number exists.
- a(n) = A083964(n)/(2n-1).A083965
a(n) = A083964(n)/(2n-1).
- Numbers n such that the concatenation 2n3n5n7 is prime.A083966
Numbers n such that the concatenation 2n3n5n7 is prime.
- Integers with the property that there exists a nontrivial partition such that the digit sum of both partitions is equal.A083967
Integers with the property that there exists a nontrivial partition such that the digit sum of both partitions is equal.
- Duplicate of A082769.A083968
Duplicate of A082769.
- Numbers n such that 2.n.3.n.5.n.7.n.11 is prime (dot means concatenation).A083969
Numbers n such that 2.n.3.n.5.n.7.n.11 is prime (dot means concatenation).
- Numbers n such that concatenation (reverse of n) and n is divisible by n.A083970
Numbers n such that concatenation (reverse of n) and n is divisible by n.
- Reverse of k concatenated with k, divided by k, where k = A083970(n).A083971
Reverse of k concatenated with k, divided by k, where k = A083970(n).
- Smallest palindromic prime containing exactly n 1's.A083972
Smallest palindromic prime containing exactly n 1's.
- Smallest palindromic prime containing exactly n 2's.A083973
Smallest palindromic prime containing exactly n 2's.
- Smallest palindromic prime containing exactly n 3's.A083974
Smallest palindromic prime containing exactly n 3's.
- Smallest palindromic prime containing exactly n 4's.A083975
Smallest palindromic prime containing exactly n 4's.
- Smallest palindromic prime containing exactly n 5's.A083976
Smallest palindromic prime containing exactly n 5's.
- Smallest palindromic prime containing exactly n 6's.A083977
Smallest palindromic prime containing exactly n 6's.
- Smallest palindromic prime containing exactly n 7's.A083978
Smallest palindromic prime containing exactly n 7's.
- Smallest palindromic prime containing exactly n 8's.A083979
Smallest palindromic prime containing exactly n 8's.
- Smallest palindromic prime containing exactly n 9's.A083980
Smallest palindromic prime containing exactly n 9's.
- Smallest palindromic prime containing exactly n zeros.A083981
Smallest palindromic prime containing exactly n zeros.
- Smallest palindromic prime containing the digit string of n.A083982
Smallest palindromic prime containing the digit string of n.
- If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. E.g. SC(232233) = 323322. Sequence contains primes p such that SC(p) is also a prime.A083983
If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. E.g. SC(232233) = 323322. Sequence contains primes p such that SC(p) is also a prime.
- If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. E.g. SC(232233) = 323322. Sequence contains numbers n such that n and SC(n) are relatively prime.A083984
If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. E.g. SC(232233) = 323322. Sequence contains numbers n such that n and SC(n) are relatively prime.
- If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. Then a(n) = gcd(A101594(n), SC(A101594(n))).A083985
If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. Then a(n) = gcd(A101594(n), SC(A101594(n))).
- If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. Then a(n) = lcm(A101594(n), SC(A101594(n))).A083986
If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. Then a(n) = lcm(A101594(n), SC(A101594(n))).
- a(n) = n-th partial concatenation of A051883 divided by n.A083987
a(n) = n-th partial concatenation of A051883 divided by n.
- Primes p such that concatenation p, 0, R(p) is also a prime (of course a palindromic prime).A083988
Primes p such that concatenation p, 0, R(p) is also a prime (of course a palindromic prime).
- Concatenation of prime k and its 10's complement is a prime.A083989
Concatenation of prime k and its 10's complement is a prime.
- Primes arising in A083989.A083990
Primes arising in A083989.
- Members of A083989 whose 10's complement is also a member of A083989.A083991
Members of A083989 whose 10's complement is also a member of A083989.
- a(1) = 1; then the smallest number such that both the forward and reverse n-th partial concatenation is a prime for n > 1. (Reverse concatenation is taken term-wise and not digit-wise.)A083992
a(1) = 1; then the smallest number such that both the forward and reverse n-th partial concatenation is a prime for n > 1. (Reverse concatenation is taken term-wise and not digit-wise.)
- a(1) = 3; a(n) = smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).A083993
a(1) = 3; a(n) = smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).
- a(1) = 7 then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).A083994
a(1) = 7 then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).
- a(1) = 9, then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).A083995
a(1) = 9, then the smallest number such that the forward as well as the reverse n-th partial concatenation is a prime for n>1. (Reverse concatenation is taken term-wise and not digit-wise).
- a(1) = 1; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime for n>1.A083996
a(1) = 1; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime for n>1.
- Primes arising in A083996.A083997
Primes arising in A083996.
- a(1) = 3; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime.A083998
a(1) = 3; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime.
- Primes arising in A083998.A083999
Primes arising in A083998.
- a(1) = 7; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime.A084000
a(1) = 7; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime.
- Primes arising in A084000.A084001
Primes arising in A084000.
- a(1) = 9; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime for n>1.A084002
a(1) = 9; then numbers such that the concatenation a(n)a(n-1)...a(2)a(1)a(2)...a(n-1)a(n) is a prime for n>1.
- Primes arising in A084002.A084003
Primes arising in A084002.
- Squares obtained as a concatenation of k and 10's complement of k.A084004
Squares obtained as a concatenation of k and 10's complement of k.
- a(n) = sqrt(A084004(n)).A084005
a(n) = sqrt(A084004(n)).
- Squares arising as a concatenation of k and 9's complement of k.A084006
Squares arising as a concatenation of k and 9's complement of k.
- a(n) = A084006(n)^(1/2).A084007
a(n) = A084006(n)^(1/2).
- a(n) = T(n) concatenated with reverse(T(n)) divided by 11, where T(n) is the n-th triangular number.A084008
a(n) = T(n) concatenated with reverse(T(n)) divided by 11, where T(n) is the n-th triangular number.
- a(n) = n^2 concatenated with reverse(n^2) divided by 11.A084009
a(n) = n^2 concatenated with reverse(n^2) divided by 11.
- a(n) = (2^n concatenated with Reverse(2^n)) divided by 11.A084010
a(n) = (2^n concatenated with Reverse(2^n)) divided by 11.