30560
domain: N
Appears in sequences
- Coordination sequence for root lattice B_4.at n=10A022146
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5*n such that x(j) divides x(k) if j divides k.at n=7A180387
- Number of circular permutations with exactly one (unspecified) increasing or decreasing modular 3-sequence, with clockwise and counterclockwise traversals not counted as distinct.at n=9A235939
- p*B_(p-1)+1 modulo p^2, where p = prime(n) and B_i denotes the i-th Bernoulli number.at n=42A268000
- Lexicographically earliest sequence of distinct terms > 0 such that the sum a(n) + a(n+1) is a substring of the concatenation (a(n), a(n+1)).at n=34A359482