38563

Appears in sequences

• a(n) = Sum_{k=0..floor(n/2)} A027144(n-k, k).at n=18A027154
• Composite numbers whose prime factors contain no digits other than 7 and 8.at n=7A036323
• Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).at n=44A082538
• The number of partitions of n which represent Chomp positions with Sprague-Grundy value 8.at n=62A284781
• Triangle T(n,r) read by rows: order of the semigroup of orientation-preserving partial transformations of n elements with breath r.at n=34A289710
• a(n) = 4^n - 3^n - binomial(n,2)*3^(n-2).at n=8A380024