1376256

Appears in sequences

• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,6)-perfect numbers.at n=7A019283
• Numbers k such that 151*2^k+1 is prime.at n=20A032425
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*8^j.at n=30A038238
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*8^j.at n=26A038274
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*4^j.at n=33A038282
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*7^j.at n=22A038285
• Number of 1's in all compositions of n+1.at n=18A045623
• A hierarchical sequence (S(W'2{3}*c) - see A059126).at n=13A059162
• Number of endofunctions of [n] with a cycle a->b->c->a and for all x in [n], some iterate f^k(x)=a.at n=5A065513
• Products of exactly 18 primes (generalization of semiprimes).at n=8A069279
• a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).at n=16A076086
• a(n) is the smallest x such that the quotient d(x)/d(x+1) equals n, where d = A000005.at n=33A080372
• Total number of leaves in the labeled graphs of order n.at n=6A095338
• Number of UFU-free Motzkin paths of length n.at n=17A095980
• a(n)=4a(n-2).at n=17A137480
• Records in (A063375: Number of divisors of Fibonacci(n)).at n=17A154906
• a(n) = 8^n*Catalan(n).at n=5A156270
• Expansion of (1+8x^2+8x^3)/((1-2x)^2*(1+2x+4x^2)).at n=16A168057
• a(n) = 21*2^n.at n=16A175805
• Exponential Riordan array (1,4*x+6*x^2+4*x^3+x^4).at n=34A187084