4026531840

Appears in sequences

• a(n) = (n+2)*2^(n-1).at n=28A001792
• a(n) = n*4^(n-1).at n=15A002697
• a(n) = 4^n - n^7.at n=16A024043
• a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,2*k) = floor(n*2^(n-3)).at n=30A049610
• a(n) is the number of occurrences of 11s in the palindromic compositions of m=2*n-1 = the number of occurrences of 12s in the palindromic compositions of m=2*n.at n=26A079863
• Expansion of g.f. (1-x)/(1-16*x).at n=8A090411
• Number of n-digit palindromes in base n.at n=14A099767
• a(n) is the least k with n prime factors (counting multiplicity) such that the sum of these n factors divides k. First member of A036844 with n prime factors.at n=29A104465
• Smallest number beginning with 4 and having exactly n prime divisors counted with multiplicity.at n=29A106424
• a(n) = 15*2^n.at n=28A110286
• Row sums of triangle A134352.at n=28A134353
• Triangle, read by rows, where T(n,k) = 2^[n*(n-1) - k*(k-1)] * binomial(n,k) for n>=k>=0.at n=23A134484
• a(n) = (2*n + 1)*16^n.at n=7A165283
• Smallest number having exactly t divisors, where t is the n-th triprime (A014612).at n=26A185445
• Hankel transform of A186032.at n=28A186033
• a(n) = n^8 - n^7.at n=16A240931
• Decimal equivalents of A268229.at n=28A268230
• Consider the Post tag system defined in A284116; a(n) = number of binary words of length n which terminate at the empty word.at n=33A289670
• Lesser of amicable numbers pair (m, n) such that n = H(m) and m = H(n) where H(n) = A074206(n) is the number of ordered factorizations of n.at n=3A318251
• Number of nonequivalent ways to place n nonattacking kings on a 2 X 2n chessboard under all symmetry operations of the rectangle.at n=28A322284