20978

Appears in sequences

• a(0) = 1. a(n+1) = sum{k=0 to n} a(n-k)*a(ceiling(k/2)).at n=14A127681
• Number of -4..4 arrays X (0..n-1) of n elements with zero sum and elements alternately strictly increasing and strictly decreasing.at n=6A200053
• T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zero sum and elements alternately strictly increasing and strictly decreasing.at n=51A200057
• Number of -n..n arrays x(0..6) of 7 elements with zero sum and elements alternately strictly increasing and strictly decreasing.at n=3A200061
• n such that A205592(n) > n.at n=9A205594
• Least k such that A205592(k) = 2^n.at n=16A205596
• Number of n-bead necklaces labeled with numbers 1..6 not allowing reversal, with no adjacent beads differing by more than 1.at n=11A208775
• Number of partitions of n into exactly 4 different parts with distinct multiplicities.at n=39A212115
• Smallest magic sum of an order-n magic square composed of consecutive Smith numbers.at n=8A213689
• Compositions with superdiagonal growth: number of compositions (p0, p1, p2, ...) of n with pi - p0 >= i.at n=39A238861
• Number of isoscent sequences of length n with maximal number of descents.at n=38A243484
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=41A272788
• Least number x such that x^n has n digits equal to k. Case k = 8.at n=24A285455
• Number of triples (i,j,k) such that i+j+k > 0 with -n <= i,j,k <= n.at n=17A302302
• On a spirally numbered square grid, with labels starting at 1, this is the number of the last cell that an (n,n+1) leaper reaches before getting trapped, or -1 if it never gets trapped.at n=22A343179