Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #32 Nov 29 2019 21:09:21
%S -2,-3,-4,-5,-6,-7,-8,-9,-15,-16,-17,-18,-19,-28,-29,-159,-168,-169,
%T -178,-179,-187,-188,-189,-197,-198,-199
%N For any negative number, add the digits (assigning the negative sign just to the first digit), square the result and add it to the original number. This sequence shows negative numbers which give a positive answer.
%C These numbers are the Zombie Numbers.
%C Start with any negative (dead) number, add the digits (attaching the negative to the first digit), square the result and add it to the original number. If your answer is positive then you have a 'zombie number' which has 'risen from the dead'.
%C The list is finite with 26 terms.
%C Negative integer k such that (digitsum(-k) - 2*(1st digit of -k))^2 > -k. - _Stefano Spezia_, Nov 01 2019
%H Ed Southall, <a href="https://twitter.com/solvemymaths/status/1189824239408422912">Twitter post about Halloween maths</a>, SolveMyMaths, Oct 31 2019.
%e -27 is not a zombie number because -2 + 7 = 5 and -27 + (5)^2 = -2.
%e -28 is a zombie number because -2 + 8 = 6 and -28 + (6)^2 = 8.
%t -Select[Range[200],(Total[IntegerDigits[#]]-2*First[IntegerDigits[#]])^2-#>0&] (* _Stefano Spezia_, Nov 01 2019 *)
%o (PARI) f(n) = my(d=digits(n), s = sumdigits(n) - 2*d[1]); s^2 + n;
%o isok(n) = f(n) > 0;
%o forstep(n=-1, -10000, -1, if (isok(n), print1(n, ", "))) \\ _Michel Marcus_, Oct 31 2019
%K sign,base,dumb,fini,full
%O 1,1
%A _Andrew Toothill_, Oct 31 2019