64065
domain: N
Appears in sequences
- a(n) is the least multiple of n such that a(n) = 1 mod k for all integers k with 1 < k < n and k relatively prime to n.at n=14A055006
- Number of self-converse loops (quasigroups with an identity element) of order n.at n=8A057996
- G.f.: 1/G(0) where G(k) = 1 + (-q)^(k+1) / (1 - (-q)^(k+1)/G(k+1) ).at n=64A227310
- 9-step Fibonacci sequence starting with 0,0,0,0,0,1,0,0,0.at n=25A251748
- Number of ways to partition n labeled elements into sets of different sizes of at least 3.at n=13A341283