26440

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 81.at n=34A031579
• Triangle T(n, k) = f(k) for k < n+1, otherwise 0, where f(k) = f(k-1) + k^(k-2)*f(k-2) with f(0) = 0 and f(1) = 1, read by rows.at n=20A136680
• Triangle T(n, k) = f(k) for k < n+1, otherwise 0, where f(k) = f(k-1) + k^(k-2)*f(k-2) with f(0) = 0 and f(1) = 1, read by rows.at n=26A136680
• Triangle T(n, k) = f(k) for k < n+1, otherwise 0, where f(k) = f(k-1) + k^(k-2)*f(k-2) with f(0) = 0 and f(1) = 1, read by rows.at n=33A136680
• Triangle T(n, k) = f(k) for k < n+1, otherwise 0, where f(k) = f(k-1) + k^(k-2)*f(k-2) with f(0) = 0 and f(1) = 1, read by rows.at n=41A136680
• Triangle T(n, k) = f(k) for k < n+1, otherwise 0, where f(k) = f(k-1) + k^(k-2)*f(k-2) with f(0) = 0 and f(1) = 1, read by rows.at n=50A136680
• Number of (w,x,y,z) with all terms in {1,...,n} and w+x<=y+z.at n=15A212560
• Number of n X 2 arrays of occupancy after each element moves to some horizontal or vertical neighbor, without move-in move-out straight through or left turns.at n=9A221795
• Number of permutations of length n containing exactly 3 occurrences of 123 and 3 occurrences of 132.at n=12A224290
• Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.at n=24A256890
• Number of length-n 0..7 arrays with no following elements larger than the first repeated value.at n=4A267470
• Number of length-5 0..n arrays with no following elements larger than the first repeated value.at n=6A267473
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 846", based on the 5-celled von Neumann neighborhood.at n=43A273689
• Numbers k such that Bernoulli number B_{k} has denominator 13530.at n=17A295587
• G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * (x + x^n)^n.at n=29A325999
• Number of cells in a regular 7-gon after n generations of mitosis.at n=27A349808
• Number of ways to write n as an ordered sum of eight positive Fibonacci numbers (with a single type of 1).at n=19A357716