45084

Appears in sequences

• Sum of three solutions of the Diophantine equation x^2 - y^2 = z^3.at n=17A085409
• Backward iterated ( limited ) Fibonacci approximation: A000045.at n=20A116557
• Consider the tiling of the plane with squares of two different sizes as in Fig. 2.4.2(g) of Grünbaum and Shephard, p. 74. a(n) is the number of connected figures that can be formed on this tiling, from n big squares and n small squares.at n=4A121195
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (0, 1), (1, 0)}.at n=11A151386
• Number of binary strings of length n with no substrings equal to 0001 0011 or 1011.at n=26A164458
• E.g.f. A(x) satisfies A(x) = 1 + log(1+x) * A(2 * log(1+x)).at n=5A355120
• Numbers k such that the sum of the proper divisors of k that have the same binary weight as k is larger than k, and no subset of these divisors sums to k.at n=24A381071