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.

A098952 Integers divisible by their number of digits.

This page as a plain text file.
%I A098952 #28 Feb 07 2022 21:45:20
%S A098952 0,1,2,3,4,5,6,7,8,9,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,
%T A098952 42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,
%U A098952 88,90,92,94,96,98,102,105,108,111,114,117,120,123,126,129,132,135,138,141
%N A098952 Integers divisible by their number of digits.
%C A098952 Complement of A171491. [_Jaroslav Krizek_, Dec 10 2009]
%H A098952 Harvey P. Dale, <a href="/A098952/b098952.txt">Table of n, a(n) for n = 1..1000</a>
%e A098952 102 has three digits and is divisible by 3, therefore 102 is in the sequence.
%t A098952 Join[{0},Select[Range[150],Divisible[#,IntegerLength[#]]&]] (* _Harvey P. Dale_, Dec 13 2020 *)
%o A098952 (Magma) [0] cat [n: n in [1..150] | IsIntegral(n/#Intseq(n))]; // _Bruno Berselli_, Feb 09 2016
%o A098952 (Python)
%o A098952 def ok(n): return n%len(str(n)) == 0
%o A098952 print([k for k in range(142) if ok(k)]) # _Michael S. Branicky_, Feb 07 2022
%Y A098952 Cf. A171491.
%K A098952 nonn,base,easy
%O A098952 1,3
%A A098952 _Eric Angelini_, Oct 21 2004
%E A098952 Corrected by _T. D. Noe_, Oct 25 2006