47776

Appears in sequences

• a(n) = T(n,n) + T(n,n+1) + ... + T(n,2n), T given by A027113.at n=10A027129
• a(1)=1; a(2)=1; a(3)=1; a(n) = 3*a(n-1) + 2*a(n-2) + a(n-3).at n=10A108136
• The first 10 digits of the cube root of n contain the digits 0-9.at n=12A119517
• Terms of A177763 which have more than one such representation.at n=32A177766
• Conjectured records d such that for all nonsquare x > A179407(n), all positive differences x^5-y^2 exceed d.at n=4A179406
• Fibonacci-type sequence based on bitwise exclusive-or: a(0) = 0, a(1) = 1 and a(n) = a(n-1) + (a(n-1) xor a(n-2)).at n=16A182201
• Number of (n+1)X4 binary arrays with no 2X2 subblock sum equal to any horizontal or vertical neighbor 2X2 subblock sum.at n=7A185792
• Number of (n+1) X 9 binary arrays with no 2 X 2 subblock sum equal to any horizontal or vertical neighbor 2 X 2 subblock sum.at n=2A185797
• Number of nonnegative integer arrays of length n+2 with new values 0 upwards introduced in order, and containing the value n-1.at n=23A211562
• Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 2 or more.at n=8A221525
• Total number of domino tilings of Ferrers-Young diagrams summed over all partitions of 2n.at n=12A304662
• Total number of tilings of Ferrers-Young diagrams using dominoes and at most one monomino summed over all partitions of n.at n=24A304680
• Index where n first appears in A381597.at n=47A381599
• Array read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the k*n boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=47A392228