34668

Appears in sequences

• a(n) = round(n*phi^18), where phi is the golden ratio, A001622.at n=6A004953
• a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.at n=6A004973
• a(n)=(1/2)*T(2n,n), where T is given by A048113.at n=9A048117
• a(n)=T(2n+1,n+1), where T is given by A048113.at n=10A048118
• Number of ways to write n! as product of squarefree numbers.at n=13A103774
• Number of n X 3 0..1 arrays with no occurrence of three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..1 introduced in row major order.at n=9A204192
• Number of nX5 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=5A207749
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=50A207752
• Number of 6Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207755
• Fibonacci numbers with the base 10 digits sorted into increasing order.at n=24A272918
• Terms of A319928 that are congruent to 4 modulo 8: Numbers k == 4 (mod 8) such that there is no other m such that (Z/mZ)* is isomorphic to (Z/kZ)*, where (Z/kZ)* is the multiplicative group of integers modulo k.at n=28A372755