26874

Appears in sequences

• Least m>0 such that prime(n) divides S(m)=A007908(m)=123...m and all numbers obtained by cyclic permutations of its digits; 0 if no such m exists.at n=43A181373
• Composite numbers whose multiplicative persistence is 6.at n=36A199996
• Generating function f(x)=(x+(x+(x+(x+(x+...)^5)^4)^3)^2)^1 is the limit as n->infinity of (f_1(x)=x, f_2(x)=x+x^2, f_3(x)=x+(x+x^3)^2, f_4(x)=x+(x+(x+x^4)^3)^2, ...).at n=28A276436
• Given the associative array U(n,k) described below, numbers m > 7 such that [m-5..m+5] are not in U(n,k) (excluding the first row and column).at n=2A345474
• Consecutive states of the linear congruential pseudo-random number generator (1861*s + 49297) mod 233280 when started at s=1.at n=29A385360