47376

Appears in sequences

• a(n) = Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2*i).at n=12A051656
• a(n) = n^n + n!.at n=5A053042
• Trajectory of 775 under the Reverse and Add! operation carried out in base 2, written in base 10.at n=7A077077
• E.g.f.: (1/(1-x^6))*exp( 6*sum_{i>=0} x^(6*i+1)/(6*i+1) ) for an order-6 linear recurrence with varying coefficients.at n=6A097681
• Third row of array in A101385.at n=11A101645
• a(0)=1, a(1)=1; for n>1, a(n) = the sum of the two largest earlier terms which are both coprime to n.at n=61A122456
• Number of permutations of order n avoiding the consecutive pattern 11'22'.at n=9A177470
• Number of 3-step one or two collinear space at a time queen's tours on an n X n board summed over all starting positions.at n=15A187028
• Triangle read by rows: T(n,k) = number of partial idempotent mappings (of an n-chain) with (right) waist exactly k.at n=50A258579
• Numbers that are a product of distinct Fibonacci numbers (A000045) and also a product of distinct Lucas numbers (A000032, including 2).at n=21A274371
• Number of maximal matchings in the n-dipyramidal graph.at n=20A297064
• Decimal representation of binary numbers with string structure 10s00, s in {0,1}*, such that it results in a non-palindromic cycle of length 4 in the Reverse and Add! procedure in base 2.at n=31A306514
• The number of small Schröder paths such that the area between the path and the x-axis contains n up-triangles.at n=13A326793
• Number of n-step self-avoiding walks on a square lattice where no step can be in the same direction as the previous step.at n=20A337353
• E.g.f. satisfies A(x) = exp(x * A(x) * (1 + x * A(x))^3).at n=5A365032
• a(n) = Sum_{k=0..floor(n/2)} n^(3*k) * binomial(n-k,k).at n=5A368889