19401

Appears in sequences

• Number of equivalence classes of binary sequences of period n.at n=22A002729
• Number of n-node rooted identity trees of height at most 8.at n=16A038087
• Sums of 5 distinct powers of 5.at n=16A038477
• Number of self-avoiding walks on square lattice rotated by Pi/4, with wedge angle Pi/2.at n=11A048738
• Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives j values.at n=14A054209
• Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=23A054210
• k! + k# + 1 is prime, where k# is the primorial function.at n=18A081710
• a(n) = round(e^(n+1)/(e^2+1)).at n=11A182197
• E.g.f. A(x) satisfies A(x) = exp(x) + x*A(x)^2.at n=5A194471
• Number of partitions of n such that (number of distinct parts) = number of 1s.at n=53A239960
• The 180-degree spoke (or ray) of a hexagonal spiral of Ulam.at n=40A244806
• Number of length 4 1..(n+2) arrays with no leading or trailing partial sum equal to a prime.at n=18A254207
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+19395) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=7A283886
• The number of trees with 5 nodes labeled by positive integers, where each tree's label sum is n.at n=23A301740
• Number of multisets of exactly four partitions of positive integers into distinct parts with total sum of parts equal to n.at n=21A320789
• a(1) = 4, and for any n > 1, a(n+1) is the a(n)-th squarefree number.at n=20A356398
• Indices k such that A358128(k) is a square.at n=46A358130
• Nonprime numbers k of the form 4*m+1 such that Sum_{j=0..k-1} 2^j * binomial(3*j, j) == 1 (mod k).at n=29A373747