147968

Appears in sequences

• Numbers k that divide the (right) concatenation of all numbers <= k written in base 17 (most significant digit on left).at n=18A029462
• a(n) = Sum_{k=0..floor(n/2)} binomial(n,k)*2^(n-2*k).at n=13A100067
• Transform of n^3 by the Riordan array (1/(1-x^2), x).at n=32A105636
• G.f.: (1+14*x+x^2)^3/((1-x))^4.at n=7A113922
• v(n+1)/v(n), where v=A203755.at n=3A203756
• a(n) = n^4/8 if n is even, a(n) = (n^2-1)^2/8 if n is odd.at n=33A212892
• Numbers k such that sigma(k) + tau(k) + phi(k) is a prime, where sigma(k) = A000203(k), tau(k) = A000005(k) and phi(k) = A000010(k).at n=22A229265
• Records values in A072994.at n=75A251642
• Sum of cubes of the first n even numbers (A016743).at n=16A254371
• Number x such that x | A255242(x).at n=36A255243
• Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 1,-1 or 2,2.at n=3A264186
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,-1 or 2,2.at n=24A264190
• Expansion of (1/(1 + x)) * Product_{k>=1} (1 + k*x^k/(1 + x)^k).at n=17A307260
• Numbers of the form 2^(2*(2^n)+1)*F_n^2, where F_n is a Fermat prime A019434.at n=2A330829