58506

Appears in sequences

• Numbers k such that sopf(k) = sopf(k+3), where sopf(k) = A008472(k).at n=34A063969
• G.f.: A(q) = exp( Sum_{n>=1} A162552(n) * 3*A038500(n) * q^n/n ).at n=31A161808
• Triangular array T(n,k) = k Sum_{j=0..k-1} (-1)^j binomial(k-1,j) (n-1-j)^(n-1), 1<=k<=n, read by rows.at n=23A281485
• Number of nX5 0..1 arrays with each 1 adjacent to 1 or 4 king-move neighboring 1s.at n=5A296016
• Number of nX6 0..1 arrays with each 1 adjacent to 1 or 4 king-move neighboring 1s.at n=4A296017
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1 or 4 king-move neighboring 1s.at n=49A296019
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 1 or 4 king-move neighboring 1s.at n=50A296019
• a(n) is the least k such that the sum of the first k numbers with n prime factors, counted with multiplicity, is prime.at n=22A376480
• Numbers k whose decimal representation can be split in three parts which can be used as seeds for a tribonacci-like sequence containing k itself.at n=37A383230