31446

Appears in sequences

• a(1) = 1; a(n+1) = floor(sqrt(Sum_{k=1..n} a(k)^2)).at n=33A067859
• Positive integers n such that S(n) divides n, where S(n) is the sum of the iterates of the Euler phi-function of n, that is, S(n) = phi(n)+phi(phi(n))+....+ 1.at n=48A113808
• G.f.: Sum_{n=-oo..+oo} ( x^n / (1 - x^(2*n)*(1+x)^(n+1)) )^2.at n=23A268656
• Number of ternary palindromes of length 2n+1 having no (7/4)+ powers.at n=46A279625
• Number of integer partitions of n whose distinct parts have integer mean.at n=48A360241
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 3 - x^2.at n=41A368152