30545

Appears in sequences

• Let F(x) = 1 + x + 4x^2 + 10x^3 + ... = g.f. for A000293 (solid partitions) and expand (1-x)(1-x^2)(1-x^3)...*F(x) in powers of x.at n=15A002836
• Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 11.at n=34A031599
• Triangle T(n,k) read by rows giving number of underdiagonal lattice paths from (0,0) to (n,k) using only steps R = (1,0), V = (0,1) and D = (3,1).at n=63A071946
• Numbers k such that 5*10^k + 2*R_k + 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=19A103010
• Triangle in A071946 with rows reversed.at n=57A108076
• a(n) = a(n-1) + a(n-2) + a(n-3), with a(0) = 1, a(1) = a(2) = 5.at n=16A214827
• Number of length 4+1 0..n arrays with the sum of the cubes of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=15A250231
• a(n) = Sum_{k=1..n} tau(gcd(k,n)^gcd(k,n)), where tau(n) is the number of divisors of n.at n=29A344224