22790

Appears in sequences

• If a Fibonacci sequence is formed with first term = number of digits in n and second term = sum of decimal digits in n, then n itself occurs as a term in the sequence after the first two terms.at n=20A038868
• Shifts left under XOR-convolution: a(n) = Sum_{k=0..n-1} a(k) XOR a(n-k-1) for n>1 with a(0)=1, a(1)=2.at n=10A192484
• G.f. A(x) satisfies: 1 = Product_{n>=1} (1 - x^n) * (1 - x^(n+1)/A(x)) * (1 - x^(n-2)*A(x)).at n=12A268651
• Number of locally nonintersecting rooted trees with n nodes.at n=13A317787
• a(n) is the number of integer partitions of n for which the smallest part is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=56A318196
• Number of separable partitions of n that consist of an even number of parts.at n=42A325723
• Numbers k such that (Sum of totatives of k) == 1 (mod Sum of primes dividing k with multiplicity).at n=44A340299