46224

Appears in sequences

• a(n) = round(n*phi^18), where phi is the golden ratio, A001622.at n=8A004953
• a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.at n=8A004973
• Triangular array generated by its row sums: T(n,0)=1 for n >= 1, T(n,1)=r(n-1), T(n,k)=T(n,k-1)+r(n-k) for k=2,3,...,n, n >= 2, r(h)=sum of the numbers in row h of T.at n=41A054115
• Subdiagonal T(n,n-3), array T as in A054115.at n=5A054118
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n with k cells in the first column. (A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column).at n=40A100822
• Least multiple of n such that every partial sum is a Fibonacci number.at n=5A112365
• Convolution of A066983 with the double Fibonacci sequence A103609.at n=23A121364
• Triangle read by rows, T(n,k) = Sum_{j=k..n} j!, 0 <= k <= n.at n=40A143122
• s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j).at n=35A205454
• s(k)-s(j), where the pairs (k,j) are given by A205857 and A205858, and s(k) denotes the (k+1)-st Fibonacci number.at n=37A205859
• s(k)-s(j), where the pairs (k,j) are given by A205867 and A205868, and s(k) denotes the (k+1)-st Fibonacci number.at n=37A205869
• s(k)-s(j), where the pairs (k,j) are given by A205872 and A205873, and s(k) denotes the (k+1)-st Fibonacci number.at n=22A205874
• Array read by antidiagonals: T(m,n) = Sum( n <= i <= m+n-1 ) i!.at n=32A211370
• Number T(n,k) of partitions of the k-dimensional hypercube resulting from a sequence of n bisections, each of which splits any part perpendicular to any of the axes, such that each axis is used at least once; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=30A255982
• a(n) = 8*Lucas(n).at n=18A258160
• Number of partitions of the 2-dimensional hypercube resulting from a sequence of n bisections, each of which splits any part perpendicular to any of the axes, such that each axis is used at least once.at n=5A258416
• Row sums of A283838.at n=17A283839
• a(n) = 144*n^2 - 24*n (n>=1).at n=17A305072
• Numbers k such that k and k+1 both have more nonunitary than unitary prime divisors (A348121).at n=39A348122
• Sum of successive Fibonacci numbers F(n) : a(n) = Sum_{k = 0..n} F(n+k).at n=11A362067