435456

Appears in sequences

• Triangle of coefficients in expansion of (1+6x)^n.at n=41A013613
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j).at n=39A038255
• Number of step shifted (decimated) sequences using a maximum of six different symbols.at n=7A056375
• Stirling2 triangle with scaled diagonals (powers of 4).at n=31A075499
• Fourth column of triangle A075499.at n=4A075907
• Starting at 1, four-fold convolution of A000400 (powers of 6).at n=8A081144
• Euler totient function phi values of multiperfect numbers.at n=10A098203
• Triangle, read by rows, of Stirling numbers of second kind, S2(n,k), multiplied by k^k, for n >= 1, 1<=k<=n.at n=31A105197
• Numbers k such that phi(sum of the proper divisors of k) = k.at n=1A107654
• Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of permutations of [1..n] in which all cycle lengths are divisible by k.at n=49A213279
• Triangle read by rows: terms T(n,k) of a binomial decomposition of 2^n-1 as Sum(k=0..n)T(n,k).at n=33A244127
• Product of the digits of the n-th Fibonacci number.at n=43A246558
• Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=33A272818
• Number of permutations of n elements divided by the number of 5-ary heaps on n+1 elements.at n=38A273733
• Triangle read by rows: T(0,0) = 1; T(n,k) = T(n-1,k) + 6*T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=54A304252
• Triangle read by rows: T(0,0) = 1; T(n,k) = 6*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.at n=39A304255
• Numbers that reach 1 under the iterations of the map k -> k/d(k) if d(k) | k, and k -> k otherwise, where d(k) is the number of divisors of k (A000005).at n=14A330816
• Expansion of Product_{k>=1} (1 + 6^(k-1)*x^k).at n=8A344065