32119

Properties

Appears in sequences

• Numbers whose base-4 representation contains exactly four 1's and four 3's.at n=26A045133
• a(0)=a(1)=1, a(n)=a(n-2)+(n+1)*a(n-1).at n=7A058279
• Primes p=prime(k) such that in binary representation k is a substring of p.at n=17A091021
• Numbers k with squares that are concatenations k^2 = x//y such that x is an anagram of y.at n=6A162945
• a(n) = 7^(floor(n/3))*A(n), where A(n) = A(n-1) + A(n-2) + A(n-3)/7, with A(0)=3, A(1)=1, A(2)=3.at n=9A215828
• Primes of the form 2*n^2 + 58*n + 27.at n=24A217498
• Primes formed by concatenation (exponent then prime) of prime factorizations of the positive integers.at n=33A226095
• Triangle read by rows: T(n,k) = (n-1)*T(n-1,k) + T(n-2,k), with T(n,n-1)=1, T(n,n-2)=n-2, for n >= 1, 0 <= k <= n-1.at n=37A228340
• Numbers that are palindromic right angle numbers in base 8.at n=4A246136
• Lesser of Gridgeman pairs in base 8 in increasing order: pairs of primes palindromic in base 8 which differ only in their middle digits by a difference of 1.at n=9A246871
• Sum of n-th powers of the roots of x^3 -31* x^2 - 25*x - 1.at n=3A274592
• Primes p such that q^2 - p^2 + 1 is the square of a composite number where p and q are consecutive primes.at n=30A316934
• Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with k peripheral nodes.at n=39A324244
• Primes p such that 2*p-1 and (2*p-1)^2+(2*p)^2 are also prime.at n=35A347165
• Prime numbersat n=3447