This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A087144 #17 Oct 20 2022 22:19:26
%S A087144 29,38,47,49,56,58,59,65,67,68,69,74,76,77,78,79,83,85,86,87,88,89,92,
%T A087144 94,95,96,97,98,119,128,137,139,146,148,149,155,157,158,159,164,166,
%U A087144 167,168,169,173,175,176,177,178,179,182,184,185,186,187,188,191,193,194,195,196,197,209
%N A087144 Numbers with sum of digits not divisible by digital root.
%C A087144 A007953(a(n)) mod A010888(a(n)) > 0.
%H A087144 Nathaniel Johnston, <a href="/A087144/b087144.txt">Table of n, a(n) for n = 1..10000</a>
%F A087144 a(n) ~ n. - _Charles R Greathouse IV_, Oct 13 2022
%p A087144 A087144 := proc(n) option remember: local k: if(n=1)then return 29: fi: k:=procname(n-1)+1: do if(add(d, d=convert(k,base,10)) mod (((k-1) mod 9) + 1) > 0)then return k: fi: k:=k+1: od: end: seq(A087144(n),n=1..70); # _Nathaniel Johnston_, May 04 2011
%t A087144 ndQ[n_]:=Module[{tidn=Total[IntegerDigits[n]],dr},dr= NestWhile[Total[ IntegerDigits[#]]&,tidn,#>9&]; !Divisible[tidn,dr]]; Select[Range[200],ndQ] (* _Harvey P. Dale_, Apr 22 2011 *)
%o A087144 (PARI) is(n)=sumdigits(n)%((n-1)%9+1) != 0 \\ _Charles R Greathouse IV_, Oct 13 2022
%Y A087144 Complement of A087143.
%Y A087144 A357772 is a subsequence.
%K A087144 nonn,base,easy
%O A087144 1,1
%A A087144 _Reinhard Zumkeller_, Aug 18 2003