20648

Appears in sequences

• Let Oc(n) = A005900(n) = n-th octahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Oc(i) = Oc(j)+Oc(k), ordered by increasing i; sequence gives i values.at n=5A053676
• Number of basis partitions of n+49 with Durfee square size 7.at n=27A053802
• Word structures of length n using a 6-ary alphabet.at n=9A056273
• Number of palindromic structures using a maximum of six different symbols.at n=16A056471
• Number of palindromic structures using a maximum of six different symbols.at n=17A056471
• Number of periodic palindromic structures using a maximum of six different symbols.at n=17A056507
• Structured great rhombicubeoctahedral numbers.at n=11A100146
• Triangle of partial sums of Stirling numbers of 2nd kind (A008277): T(n,k) = Sum_{i=1..k} Stirling2(n,i), 1<=k<=n.at n=41A102661
• a(n) = Fibonacci(n) * (Fibonacci(n+2) - 1).at n=10A143212
• Number of (n+1) X 2 binary arrays with every 2 X 2 subblock trace equal to some horizontal or vertical neighbor 2 X 2 subblock trace.at n=8A185742
• T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock trace equal to some horizontal or vertical neighbor 2X2 subblock trace.at n=36A185750
• T(n,k) = Number of (n+1) X (k+1) binary arrays with every 2 X 2 subblock trace equal to exactly one or two horizontal and vertical neighbor 2 X 2 subblock traces.at n=36A186939
• T(n,k)=Number of n-step one or two space at a time bishop's tours on a kXk board summed over all starting positions.at n=59A187046
• Number of 5-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=6A187049
• The number of parents of successive approximations used in a greedy approach to creating a Garden of Eden in Conway's Game of Life.at n=11A196447
• T(n,k)=Number of nXk 0..5 arrays with every 2X2 subblock containing exactly one value repeat, and new values 0..5 introduced in row major order.at n=36A209744
• Number of n-variations of the set {1,2,...,n+1} satisfying p(i)-i in {-2,0,2}, i=1..n (an n-variation of the set N_{n+s} = {1,2,...,n+s} is any 1-to-1 mapping p from the set N_n = {1,2,...,n} into N_{n+s} = {1,2,...,n+s}).at n=20A217694
• Number of length n+4 0..7 arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=0A247926
• T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=21A247927
• Number of length 1+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum.at n=6A247928