cp's OEIS Frontend

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.

A075492 Sum of digits of n < number of divisors of n.

This page as a plain text file.
%I A075492 #13 Apr 05 2015 08:55:50
%S A075492 10,12,20,21,24,30,32,40,42,50,60,70,72,80,90,100,102,104,105,108,110,
%T A075492 111,112,114,120,126,130,132,140,144,150,160,162,168,180,192,200,201,
%U A075492 204,210,212,216,220,222,224,230,231,232,234,240,250,252,260,264,270
%N A075492 Sum of digits of n < number of divisors of n.
%F A075492 Solutions to A007953[x] < A000005[x]
%e A075492 All are special composites.
%t A075492 sud[x_] := Apply[Plus, IntegerDigits[x]] Do[s=sud[n]-DivisorSigma[0, n]; If[s>0, Print[n]], {n, 1, 256}]
%t A075492 Select[Range[300],Total[IntegerDigits[#]]<DivisorSigma[0,#]&] (* _Harvey P. Dale_, Apr 05 2015 *)
%Y A075492 Cf. A007953, A000005, A057531, A075492, A075493.
%K A075492 base,easy,nonn
%O A075492 1,1
%A A075492 _Labos Elemer_, Sep 26 2002