18843

Appears in sequences

• Define the sequence S(a_0,a_1) by a_{n+2} is the least integer such that a_{n+2}/a_{n+1}>a_{n+1}/a_n for n >= 0. This is S(3,6).at n=11A018909
• Values of A038005 ending in 3.at n=24A038013
• Exponent of least power of 2 having exactly n consecutive 3's in its decimal representation.at n=8A131537
• Number of n X n binary arrays symmetric about main diagonal with all ones connected only in a 1100-0111-0001 pattern in any orientation.at n=10A146661
• Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1100-0111-0001 pattern in any orientation.at n=22A146663
• Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1100-0111-0001 pattern in any orientation.at n=23A146663
• a(n) = 1331*n - 1122.at n=14A157441
• Smallest sets of 6 consecutive deficient numbers in arithmetic progression. The initial deficient number is listed.at n=3A231628
• Number of partitions p of n such that (number of even numbers in p) <= (number of odd numbers in p).at n=38A241637
• Number of partitions of n into a squarefree number of squarefree parts.at n=49A286330
• Number of nX7 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 3 or 6 neighboring 1s.at n=12A296553
• Numbers in A231626 but not in A343302; first of 5 consecutive deficient numbers in arithmetic progression with common difference > 1.at n=32A343303
• Triangle read by rows: T(n,k) is the number of weakly connected acyclic digraphs on n unlabeled nodes with k arcs, n >= 1, k = 0..(n-1)*n/2.at n=56A350449