Sequences
392,541 sequences
- Trinomial transform of the Fibonacci numbers (A000045).A082761
Trinomial transform of the Fibonacci numbers (A000045).
- Trinomial transform of Lucas numbers (A000032).A082762
Trinomial transform of Lucas numbers (A000032).
- Roman numeral contains an asymmetric symbol (L).A082763
Roman numeral contains an asymmetric symbol (L).
- Trinomial transform of the Pell numbers (A000129).A082764
Trinomial transform of the Pell numbers (A000129).
- Trinomial transform of the factorial numbers (A000142).A082765
Trinomial transform of the factorial numbers (A000142).
- Series ratios converge alternately to sqrt(2) and 1+sqrt(1/2).A082766
Series ratios converge alternately to sqrt(2) and 1+sqrt(1/2).
- Number of edges in the prime graph.A082767
Number of edges in the prime graph.
- Numbers that begin with 1, 3, 7 or 9.A082768
Numbers that begin with 1, 3, 7 or 9.
- a(n) = smallest palindromic prime that begins with A082768(n), or 0 if no such number exists.A082769
a(n) = smallest palindromic prime that begins with A082768(n), or 0 if no such number exists.
- a(n) = smallest palindromic prime that begins with A082768(n) and contains more than twice the number of digits in A082768(n), or 0 if no such number exists.A082770
a(n) = smallest palindromic prime that begins with A082768(n) and contains more than twice the number of digits in A082768(n), or 0 if no such number exists.
- Triangular array, read by rows: T(n,k) = Sum_{d|n} d^k, 0 <= k < n.A082771
Triangular array, read by rows: T(n,k) = Sum_{d|n} d^k, 0 <= k < n.
- Integers n such that there exists at least one divisor d of n, 1 < d < n, such that d divides n and d+1 divides n+1.A082772
Integers n such that there exists at least one divisor d of n, 1 < d < n, such that d divides n and d+1 divides n+1.
- Integers n such that there exists at least one divisor d of n, 1 < d < n, such that d divides n, d+1 divides n+1 and d+2 divides n+2.A082773
Integers n such that there exists at least one divisor d of n, 1 < d < n, such that d divides n, d+1 divides n+1 and d+2 divides n+2.
- a(n) = floor(cot(2*Pi/prime(n))).A082774
a(n) = floor(cot(2*Pi/prime(n))).
- Convolution of natural numbers >= 2 and the partition numbers (A000041).A082775
Convolution of natural numbers >= 2 and the partition numbers (A000041).
- a(1) = 1, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082776
a(1) = 1, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- a(1) = 2, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082777
a(1) = 2, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- a(1) = 3; for n>1, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082778
a(1) = 3; for n>1, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- a(1) = 4, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082779
a(1) = 4, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- a(1) = 5, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082780
a(1) = 5, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- a(1) = 6, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082781
a(1) = 6, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- a(1) = 7, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082782
a(1) = 7, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- a(1) = 8, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).A082783
a(1) = 8, a(n) = smallest palindromic multiple of a(n-1) obtained by inserting digits anywhere in a(n-1).
- Characteristic function of multiples of 7.A082784
Characteristic function of multiples of 7.
- Number of ways n can be written as the sum of a brilliant number and a prime.A082785
Number of ways n can be written as the sum of a brilliant number and a prime.
- Triangle, read by rows, of exponents of primes in canonical prime factorization of n: T(n,k) = greatest number such that prime(k)^T(n,k) divides n, 1 <= k <= n.A082786
Triangle, read by rows, of exponents of primes in canonical prime factorization of n: T(n,k) = greatest number such that prime(k)^T(n,k) divides n, 1 <= k <= n.
- a(n) = (2/3)*(2*n-1)!*binomial(3*n,2*n).A082787
a(n) = (2/3)*(2*n-1)!*binomial(3*n,2*n).
- Numbers k such that the product of Euler phi of the 2 consecutive integers {k,k+1} is a 4th power: if sqrt(sqrt(phi(k)*phi(k+1))) is an integer, then k is here.A082788
Numbers k such that the product of Euler phi of the 2 consecutive integers {k,k+1} is a 4th power: if sqrt(sqrt(phi(k)*phi(k+1))) is an integer, then k is here.
- Number of nonisomorphic configurations of n triples in Steiner triple systems.A082789
Number of nonisomorphic configurations of n triples in Steiner triple systems.
- Number of nonisomorphic configurations of degree >= 2 (or generators) of n triples in Steiner triple systems.A082790
Number of nonisomorphic configurations of degree >= 2 (or generators) of n triples in Steiner triple systems.
- Smallest k such that k*n begins with 2: a(n) = A082811(n)/n.A082791
Smallest k such that k*n begins with 2: a(n) = A082811(n)/n.
- Smallest multiple of n beginning with 3.A082792
Smallest multiple of n beginning with 3.
- A tribonacci triangle in which the top two northeast and southeast diagonals consist of tribonacci numbers.A082793
A tribonacci triangle in which the top two northeast and southeast diagonals consist of tribonacci numbers.
- Smallest multiple of n beginning with 4.A082794
Smallest multiple of n beginning with 4.
- Smallest multiple of n beginning with 5.A082795
Smallest multiple of n beginning with 5.
- Smallest multiple of n beginning with 6.A082796
Smallest multiple of n beginning with 6.
- Smallest multiple of n beginning with 7.A082797
Smallest multiple of n beginning with 7.
- Smallest multiple of n beginning with 8.A082798
Smallest multiple of n beginning with 8.
- Smallest multiple of 3 beginning with n.A082799
Smallest multiple of 3 beginning with n.
- Smallest multiple of 4 beginning with n.A082800
Smallest multiple of 4 beginning with n.
- Smallest multiple of 6 beginning with n.A082801
Smallest multiple of 6 beginning with n.
- Smallest multiple of 7 beginning with n.A082802
Smallest multiple of 7 beginning with n.
- Smallest multiple of 8 beginning with n.A082803
Smallest multiple of 8 beginning with n.
- Smallest multiple of 9 beginning with n.A082804
Smallest multiple of 9 beginning with n.
- Duplicate of A071119.A082805
Duplicate of A071119.
- Palindromes which are prime and the sum of the digits is also prime.A082806
Palindromes which are prime and the sum of the digits is also prime.
- Palindromic primes p with property that another palindromic prime with as many digits can be obtained by using all the digits of p with a different frequency >=1 (every digit is used at least once).A082807
Palindromic primes p with property that another palindromic prime with as many digits can be obtained by using all the digits of p with a different frequency >=1 (every digit is used at least once).
- Palindromic primes whose digit permutation yields at least one other palindromic prime.A082808
Palindromic primes whose digit permutation yields at least one other palindromic prime.
- Duplicate of A070245.A082809
Duplicate of A070245.
- Palindromes in which every digit occurs with equal frequency.A082810
Palindromes in which every digit occurs with equal frequency.