23116

Appears in sequences

• From George Gilbert's marks problem: jumping 6 marks at a time (final positions).at n=14A019996
• T(n,0) + T(n,1) + ... + T(n,n), T given by A026692.at n=13A026699
• Triangle read by rows: a(1,1)=1. a(m,n) = a(m-1,n) + (sum of all terms in row m-1), for n<m. a(m,m) = sum of all terms in row m-1.at n=29A159930
• The Wiener index of the graph \|/_\/_\/_..._\/_\|/ having n nodes on the horizontal path.at n=21A180571
• Total size of all principal order ideals in the poset of integer partitions of n with the refinement order.at n=17A265947
• Triangle read by rows: T(n,k) (n>=0, 0<=k<=n) = number of partitions of n with exactly k kinds of 1's which are introduced in ascending order.at n=61A292746
• Partial sums of A294629.at n=28A294630
• Number of n X n 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A299683
• Number of nX5 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A299686
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=40A299689
• Number of edge covers in the n-path complement graph.at n=6A302719
• Number of partitions of n with exactly six sorts of part 1 which are introduced in ascending order.at n=4A320819
• Number of integer partitions of n that have an even number of parts and cannot be partitioned into distinct pairs of distinct parts, i.e., that are not the multiset union of any set of edges.at n=44A339559
• Number of vertices formed by infinite lines when connecting all vertices and all points that divide the sides of an equilateral triangle into n equal parts.at n=9A344657
• Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the smallest cell covered.at n=6A345889
• Triangle read by rows: T(n,k) = (Sum_{i=k..n} i!)/(k!) for 0 <= k <= n.at n=38A348482
• Numbers t which satisfy the equation: t mod k = floor((t - k)/k) mod k (1 <= k <= t) only for k = 1 and t.at n=25A375007