61439

Appears in sequences

• a(n) = (n+3)*2^n - 1.at n=13A006589
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 35 ones.at n=28A031803
• Least m which can be written as i*j+i+j in n different ways: A072670(m)=n.at n=25A072671
• a(1)=1, a(n) = ceiling(r(3)*a(n-1)) where r(3) = (1/2)*(3 + sqrt(13)) is the positive root of X^2 = 3*X + 1.at n=9A082574
• a(n) = 60*n^2 - 1.at n=31A158670
• Numbers which contain only the digit 3 in their base-4 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1 or 2, otherwise the exception must be the digit 2.at n=44A188529
• a(n) = 15*2^n - 1.at n=12A196305
• Smallest m such that A199238(m) = n.at n=14A199262
• a(n) is the smallest number k representable as x*y+x+y, where x>=y>1, in exactly n ways, or -1 if no such k exists.at n=23A253975
• Decimal representation of the n-th iteration of the "Rule 169" elementary cellular automaton starting with a single ON (black) cell.at n=9A267586
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 205", based on the 5-celled von Neumann neighborhood.at n=17A279825
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 950", based on the 5-celled von Neumann neighborhood.at n=15A284481
• 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 347", based on the 5-celled von Neumann neighborhood.at n=15A287752
• Number of non-knapsack integer partitions of n.at n=43A366754