26469

Appears in sequences

• a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=23A001210
• a(1) = 2; a(n) = k*a(n-1) + 1 is a multiple of n-th prime with k > 1.at n=6A069564
• Numbers m such that m is k*(the sum of decimal digits squared of m), k=153 case.at n=6A117810
• Nonprime numbers k of the form 4*m+1 such that Sum_{j=0..k-1} 2^j * binomial(3*j, j) == 1 (mod k).at n=41A373747