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 #9 Feb 18 2019 15:32:39
%S 2,3,4,5,6,7,8,9,12,13,15,16,17,18,20,21,22,23,24,25,26,27,28,29,30,
%T 32,33,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,
%U 56,57,58,59,60,61,62,63,64,66,67,68,69,70,72,73,74,75,76,77
%N Numbers k such that the sum of decimal digits of k does not divide k+1.
%H Nathaniel Johnston, <a href="/A178338/b178338.txt">Table of n, a(n) for n = 1..10000</a>
%p read(transforms): A178338 := proc(n) option remember: local k: if(n=1)then return 2: fi: for k from procname(n-1)+1 do if((k+1) mod digsum(k) <> 0)then return k: fi: od: end: seq(A178338(n),n=1..68); # _Nathaniel Johnston_, May 27 2011
%Y Complement of A144980.
%K base,easy,nonn
%O 1,1
%A _Giovanni Teofilatto_, May 25 2010