68085

Appears in sequences

• Triangle read by rows: T(n,k) (0 <= k <= floor(n/2)) is the number of lattice paths from (0,0) to (2n,0) consisting of steps U=(1,1), D=(1,-1), H=(2,0), never going below the x-axis (i.e., Schroeder paths) and having k UH's.at n=33A110220
• Odd composites for which gcd(A325977(n), A325978(n)) is equal to abs(A325977(n)).at n=15A325981
• Recurrence a(1) = 1, a(2) = 5; a(n) = (a(n-1) + a(n-2))/GCD(a(n-1),a(n-2)) + 1.at n=37A349576