36861

Appears in sequences

• Let u(1)=u(2)=1, u(3)=n, u(k) = (1/2)*abs(2*u(k-1) -u(k-2)-u(k-3)); sequence gives values of n such that Sum_{k>=1} u(k) is an integer.at n=25A078113
• a(n) = 1 + Sum(prime(i)*(2*i-1): 1<=i<=n).at n=24A083215
• Twin prime products minus 2.at n=13A124659
• G.f. satisfies: A(x) = (1 + x + x^2) * A(x^2)^4.at n=17A237648
• Number of partitions of n such that (number of distinct parts) >= least part.at n=40A239952
• Number of nX3 0..1 arrays with every element unequal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=15A304005
• Number of 4-tuples of nonnegative integers less than p for which 4-argument multinomial coefficients support a Lucas congruence modulo p^2, where p is the n-th prime.at n=6A348886