156442

Appears in sequences

• a(1)=1; a(n) = gcd(a(n-1), n) + lcm(a(n-1), n).at n=10A129090
• A Pascal triangle with an Eulerian-number shift: p(x,n)=If[n < 1, (x + 1)^(n + 1), (x + 1)^(n + 1) + (1 - x)^(n + 1)*PolyLog[ -n, x]].at n=60A147290