194922

Appears in sequences

• Numbers k such that core(k) = ceiling(sqrt(k)) where core(k) is the squarefree part of k (the smallest integer such that k*core(k) is a square).at n=19A069187
• a(n) = n^2*(n^2+1).at n=21A071253
• Fibonacci double product triangle:If[n == 1, 1, If[n == 0, 1, Product[Fibonacci[(i - 1)]*Fibonacci[i], {i, 2, n}]]];t(n,m)=c(n)/(c(m)*c(n-m)).at n=47A173886
• Fibonacci double product triangle:If[n == 1, 1, If[n == 0, 1, Product[Fibonacci[(i - 1)]*Fibonacci[i], {i, 2, n}]]];t(n,m)=c(n)/(c(m)*c(n-m)).at n=52A173886
• A product triangle sequence based on:a=1;f(n, a) = f(n - 1, a) + a*f(n - 2, a); c(n,a)=If[n == 0, 1, Product[f(i, a)*f(i + 1, a), {i, 1, n}]]; t(n,m,a)=If[Floor[n/2] >= m, c(n, a)/c(n - m, a), c(n, a)/c(m, a)].at n=38A174411
• A product triangle sequence based on:a=1;f(n, a) = f(n - 1, a) + a*f(n - 2, a); c(n,a)=If[n == 0, 1, Product[f(i, a)*f(i + 1, a), {i, 1, n}]]; t(n,m,a)=If[Floor[n/2] >= m, c(n, a)/c(n - m, a), c(n, a)/c(m, a)].at n=42A174411
• Primitive numbers that are the sum of the squares of two of their distinct divisors.at n=36A338485
• a(n) is the number whose base-(n+1) expansion equals the binary expansion of n.at n=19A356274
• a(n) = Sum_{p|n, p prime} n^pi(n/p).at n=20A369868
• Nonsquare integers >= 2 for which the square of its largest prime factor equals the sum of the squares of its other prime factors, with multiplicity.at n=10A391874