10310

Properties

Appears in sequences

• a(n) = (d(n)-r(n))/2, where d = A026037 and r is the periodic sequence with fundamental period (1,0,0,1).at n=37A026038
• Numbers written in base 4 whose digits are, in order, the first n terms of the periodic sequence with initial period 1,0,3.at n=4A037596
• Multiples of 5 with digit sum 5.at n=25A069540
• Numbers divisible by the sum of factorials of their digits [A061602(n)] and also terminate in the sum of factorials of their digits.at n=8A071064
• Triangle read by rows: n-th row contains the first n n-digit multiples of n with digit sum n. If there are fewer than n such numbers, the rest of the row is filled with 0's.at n=13A084029
• Numbers k such that k^2 + 1 = p*q, p and q primes and |p-q| is square.at n=26A187401
• Array read by antidiagonals, m>=0, n>=0, A(m,n) = sum{k=0..n} sum{j=0..m} sum{i=0..m} (-1)^(j+i)*C(i,j)*n^j*k^(m-j).at n=60A198061
• Sum of the largest parts in the partitions of 4n into 4 parts with smallest part = 1.at n=14A240711
• Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 10.at n=30A244539
• Number T(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=26A257740
• Sequence A261220 shown in factorial base: a(n) = A007623(A261220(n)).at n=35A260743
• Number of squares of all sizes in polyominoes obtained by union of two pyramidal figures (A092498) with intersection equals A002623.at n=30A260918
• Number of nX5 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than or equal to itself.at n=2A266052
• T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than or equal to itself.at n=23A266055
• Number of 3Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors less than or equal to itself.at n=4A266057
• Number of multisets of nonempty words with a total of n letters over quinary alphabet such that all letters occur at least once in the multiset.at n=1A320215
• Lexicographically first sequence starting with a(1) = 1, with no duplicate term, such that a(n) is the result of a self-additive linear combination of its own digits (concatenated sometimes into substrings).at n=52A323823
• Sum of the seventh largest parts in the partitions of n into 10 parts.at n=42A326592
• Factors k > 2 such that the polynomial x^2 + k*x + 1 produces a new minimum of its Hardy-Littlewood constant.at n=12A332707
• Numbers k such that A338338(k) is a prime p that ends a run of three terms in A338338 that are divisible by p.at n=32A338344