33688

Appears in sequences

• Integer part of square root of n-th Fibonacci number.at n=45A061287
• Difference between A007678(2n)/(2n) and (n-1)^2.at n=48A085611
• a(n) = round(sqrt(Fibonacci(n))).at n=45A100665
• Numbers k such that k and k^2 use only the digits 1, 3, 4, 6 and 8.at n=15A137026
• Symmetrical triangle read by rows: T(n, k) = m*(T(n-1, k-1) + T(n-1, k)), where T(n, 1) = T(n, n) = n, and m = 2.at n=48A177696
• Symmetrical triangle read by rows: T(n, k) = m*(T(n-1, k-1) + T(n-1, k)), where T(n, 1) = T(n, n) = n, and m = 2.at n=51A177696
• Number of (n+1) X (n+1) 0..3 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=1A206101
• Number of (n+1) X 3 0..3 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=1A206103
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.at n=4A206109
• The number of overpartitions of n whose Frobenius symbols have only positive parts in the top row.at n=29A347207