55808

Appears in sequences

• a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=38A050071
• Numbers n such that 83*2^n-1 is prime.at n=35A050567
• a(n) = Fibonacci(n) AND Fibonacci(n+1).at n=26A051122
• Number of 2's in n-th "Kolakoski" string defined in A054349.at n=27A111123
• Numbers of the form p^9*q where p and q are distinct primes.at n=28A179692
• Number of length 3 0..n arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean.at n=38A244942
• The number of overpartitions of n with restricted odd differences.at n=36A260890
• Numbers n such that n and n+1 both have 20 divisors.at n=9A274361
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood.at n=18A287136
• Number of trihexagonal magic figures of order n using the numbers 1 through 3*n*(n+1)/2 (the 2*n X 2*n triangular array), obtained by applying the trihexagonal tiling so that triangular and hexagonal faces appear alternately, such that all triangular faces share a common sum and all hexagonal faces share a common sum (the latter being exactly twice the former), counted up to rotations and reflections of the overall triangular shape.at n=4A391236