70252
domain: N
Appears in sequences
- Triangle T(n,k) defined by Sum_{k=1..n} T(n,k)*u^k*t^n/n! = ((1+t)*(1+t^2)*(1+t^3)...)^u.at n=30A075525
- Integers n > 1 such that A130280(4n^2) < n, i.e., there is an m < n, m > 1 such that 4n^2(m^2 - 1) + 1 is a square.at n=29A130281
- a(n) = 12spt(n) + (24n - 1)p(n), with a(0) = -1.at n=15A220481
- p-INVERT of (1,1,0,0,0,0,...), where p(S) = 1 - S^2 - 2 S^4.at n=16A291404
- a(n) = (n!/6) * Sum_{i,j,k > 0 and i+j+k=n} A000593(i)*A000593(j)*A000593(k)/(i*j*k).at n=7A338788
- Number of maximal subsets of {1..n} containing n such that it is possible to choose a different prime factor of each element (choosable).at n=39A370590