192900147840domain: NAppears in sequencesa(n) = (Lucas(2n) + Lucas(2n+1)*phi)/kappa(phi/Fibonacci(4n)) where kappa(x) is the sum of successive remainders in computing the Euclidean algorithm for (1,x).at n=8A088913Inflation orbit counts b^{(2)}_n for 2D cut and project patterns with tau-inflation.at n=26A324484