69336

Appears in sequences

• a(n) = round(n*phi^18), where phi is the golden ratio, A001622.at n=12A004953
• a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.at n=12A004973
• Number of 1's in n-th term of A007651.at n=42A022466
• a(n) = T(2n,n), where T is given by A048113.at n=10A048116
• House numbers (version 2): a(n) = (n+1)^3 + (n+1)*Sum_{i=0..n} i.at n=35A050509
• Integer part of square root of n-th Fibonacci number.at n=48A061287
• a(n) = round(sqrt(Fibonacci(n))).at n=48A100665
• Number of rectangles in a pyramid built with squares. The squares counted in A092498 are excluded.at n=24A134507
• Number of (n+2) X 3 binary arrays avoiding patterns 000 and 111 in rows, columns and nw-to-se diagonals.at n=7A202640
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 111 in rows, columns and nw-to-se diagonals.at n=28A202647
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 111 in rows, columns and nw-to-se diagonals.at n=35A202647
• Number of (n+1) X (2+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=3A234684
• Number of (n+1) X (4+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=1A234686
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=11A234690
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings).at n=13A234690
• a(0)=0, a(1)=1, a(n) = min{5 a(k) + (5^(n-k)-1)/4, k=0..(n-1)} for n>=2.at n=24A259669
• Numbers m such that (1/m) * Sum_{k=1..m} phi(k)/k is closer to 6/Pi^2 than it is for any number smaller than m, where phi is the Euler totient function (A000010).at n=29A385561