3543750

Appears in sequences

• Triangle whose (n,k)-th entry is 15^(n-k)*binomial(n,k).at n=40A027467
• Triangle of integers used to compute column sequences of array A078739 ((2,2)-Stirling2).at n=40A089511
• Prime factorization representation of Stern polynomials: a(0) = 1, a(1) = 2, a(2n) = A003961(a(n)), a(2n+1) = a(n)*a(n+1).at n=37A260443
• Even terms in A260442 (in A260443).at n=26A277200
• Prime-factorization representation of the prime-th Stern-polynomial: a(n) = A260443(A000040(n)).at n=11A277316
• Numbers k such that A277333(k) is a prime.at n=14A277317
• Prime-factorization representation of irreducible (non-constant) Stern-polynomials B(n,x), listed in the order of increasing index n: a(n) = A260443(A186891(n+1)).at n=12A277318
• Odd bisection of A260443 (the even terms): a(n) = A260443((2*n)+1).at n=18A277324
• Record values in A260443.at n=14A277703
• Triangular array read by rows. T(n,k) is the number of labeled posets on [n] of rank at most one with exactly k elements of positive indegree, n >= 0, 0 <= k <= max{0,n-1}.at n=33A369919
• Prime-factorization representation of irreducible (non-constant) Stern-polynomials B(m,x), listed in ascending order.at n=16A389912