109228

Appears in sequences

• a(n) = smallest number greater than a(n-1) having a largest proper divisor that is greater than and coprime to a(n-1); a(1) = 1.at n=45A098144
• Numbers n such that A003313(3n) < A003313(n).at n=21A104699
• a(0)=2, a(1)=8, a(n) = a(n-1) + 2*a(n-2).at n=15A115102
• Numbers k such that A003313(k) = A003313(6*k).at n=21A116461
• a(n) = 4*a(n-1) - 4 for n>0, a(0)=3.at n=8A135583
• Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.at n=22A228892
• Number of n X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1's.at n=4A297756
• Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s.at n=4A297759
• T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s.at n=40A297762
• Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s.at n=4A297766