22191

Appears in sequences

• a(1) = 2, thereafter a(n) = Sum_{k=1..n-1} floor(a(n-k)/k).at n=23A100483
• 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, -1, 0), (-1, 1, -1), (-1, 1, 0), (-1, 1, 1), (1, 0, 0)}.at n=10A148551
• The A161671(n)-th partial sum of A161671.at n=37A161778
• Numbers x such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of sigma(x) and all cyclic permutations of Euler totient function phi(x).at n=24A247317
• a(n) = number of tuples (a,b,c,d) of natural numbers a,b,c,d <= n with gcd(a,b)=gcd(b,c)=gcd(c,d)=gcd(d,a)=1.at n=16A256391
• Isolated deficient numbers that are divisible by 3.at n=34A273255
• Total sum of the left-to-right minima in all compositions of n.at n=14A336512
• Number of partitions of n into an even number of parts such that the set of even parts has only one element.at n=51A341494
• Number of partitions of n with exactly one repeated part and that part is odd.at n=51A341497
• a(n) = Sum_{k=0..n} 4^(n-k) * floor(k/3).at n=10A368345
• Number of compositions of n such that any part 1 can be m different colors where m is the largest part of the composition.at n=9A383101