The sequence is finite and fullcomplete. In general, a number x = x_1 x_2 ... x_n of n digits belongs to the sequence if its digits satisfy a certain Diophantine equation c_1*x_1 + c_2*x_2 + ... + c_n*x_n = 0, where the coefficients c_i depend on n. It is easy to verify that for n > 11 all the coefficient c_i are positive, so the equation does not admit a nonzero solution. - Giovanni Resta, Jul 20 2015
editing
approved
(PARI) isok(n) = {d = digits(n); if (sumdigits(n)*(#d-2) % 9 , return (0)); s = 0; for (i=1, #d, nd = vector(#d-1, j, if (i > j, d[j], d[j+1])); s += subst(Pol(nd), x, 10); ); s == n; } \\ Michel Marcus, Apr 24 2014
Jon Ayres (jonathan.ayres(AT)ntlworld.com), Sep 05 2007
approved
editing
editing
approved
The sequence is finite and full. In general, a number x = x_1 x_2 ... x_n of n digits belongs to the sequence if its digits satisfy a certain Diophantine equation c_1*x_1 + c_2*x_2 + ... + c_n*x_n = 0, where the coefficients c_i depend on n. It is easy to verify that for n > 11 all the coefficient c_i are positive, so the equation does not admit a non-zero nonzero solution. - Giovanni Resta, Jul 20 2015
approved
editing
proposed
approved
editing
proposed
The sequence is finite and full. In general, a number x = x_1 x_2 ... x_n of n digits belongs to the sequence if its digits satisfy a certain Diophantine equation c_1*x_1 + c_2*x_2 + ... + c_n*x_n = 0, where the coefficients c_i depend on n. It is easy to verify that for n > 11 all the coefficient c_i are positive, so the equation does not admit a non-zero solution. - Giovanni Resta, Jul 20 2015
base,easy,nonn,full,fini
approved
editing
proposed
approved
editing
proposed