1050624

Appears in sequences

• Numbers that are the sum of 3 nonzero 10th powers.at n=12A004803
• Numbers that are the sum of at most 3 nonzero 10th powers.at n=25A004898
• Numbers k such that A007947(k) = A007947(m+1) and A007947(m) = A007947(k+1), where k > m.at n=11A088966
• Number of binary pattern classes in the (2,n)-rectangular grid; two patterns are in same class if one of them can be obtained by reflection or rotation of the other one.at n=10A132390
• a(n) = the smallest positive multiple of n that has exactly n (nonleading) 0's in its binary representation.at n=18A143116
• a(n) = n^4*(n^3 + 1)/2.at n=8A168194
• The number of simple labeled graphs on n nodes where two such graphs are considered equivalent iff one can be obtained from the other by reversing the labeling.at n=6A199574
• Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two or four distinct values for every i,j,k<=n.at n=18A211525
• 4-level binary fanout graph coloring a rectangular array: number of nX3 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=5A223444
• 4-level binary fanout graph coloring a rectangular array: number of nX6 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=2A223447
• T(n,k)=4-level binary fanout graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=30A223449
• T(n,k)=4-level binary fanout graph coloring a rectangular array: number of nXk 0..14 arrays where 0..14 label nodes of a graph with edges 0,1 1,3 3,5 3,6 1,4 4,7 4,8 0,2 2,9 9,11 9,12 2,10 10,13 10,14 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=33A223449
• Number of binary pattern classes in the (2,n)-rectangular grid: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=11A225826
• a(n) = 4^n + 2^(n+1).at n=10A242985
• Eighth pi-based arithmetic derivative of n.at n=27A258858
• Numbers n such that n^2 XOR n^3 is a square, where XOR is the bitwise XOR operator.at n=34A261808
• Number of monomials in c(n) where c(1) = x, c(2) = y, c(n+2) = c(n+1) + c(n)^2.at n=23A290075
• Fixed points of A323710.at n=13A323752
• Number of solutions of y^2 + y = x^3 + x where x and y are in GF(2^n).at n=19A362374
• Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k grid up to horizontal reflection by two tiles that are each fixed under horizontal reflection.at n=42A368221