19432

Appears in sequences

• "DHK[ 6 ]" (bracelet, identity, unlabeled, 6 parts) transform of 1,1,1,1,...at n=25A032247
• Number of binary rooted trees with n nodes and internal path length n.at n=46A108643
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (0, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A149490
• Sequence whose Hankel transform is the Somos (4) sequence.at n=12A173992
• a(n) equals the sum of path counts in the (right-aligned Ferrers plots of) the partitions of n.at n=21A180684
• Number of (n+2)X(1+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=7A252804
• T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=28A252811
• T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=35A252811
• Positive numbers k such that k^2 - 1 divides 8^k - 1.at n=48A272062
• Numbers n such that phi(n) = Sum_{j=1..k} d(n^j) for some k, where phi(n) is the Euler totient function of n and d(n) is the number of divisors of n.at n=44A283757
• 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=36A283886