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.

A091802 10^n - (largest n-digit multiple of the n-th prime).

This page as a plain text file.
%I A091802 #7 Dec 05 2013 19:56:45
%S A091802 2,1,5,4,10,1,5,17,20,6,19,1,16,36,40,46,8,41,6,48,63,67,63,78,71,100,
%T A091802 37,12,30,31,66,12,10,79,83,20,146,145,158,132,8,36,86,46,109,89,111,
%U A091802 210,177,12,186,44,58,211,192,33,183,187,154,165,176,235,269,289,168,38
%N A091802 10^n - (largest n-digit multiple of the n-th prime).
%H A091802 Harvey P. Dale, <a href="/A091802/b091802.txt">Table of n, a(n) for n = 1..1000</a>
%t A091802 ndmd[n_]:=Module[{x=Prime[n]},10^n-x Floor[(10^n-1)/x]]; Array[ndmd,70] (* _Harvey P. Dale_, Jan 05 2012 *)
%Y A091802 a(n) = 10^n - A091801(n).
%Y A091802 Cf. A091803, A091804.
%K A091802 base,nonn
%O A091802 1,1
%A A091802 _Amarnath Murthy_, Feb 21 2004
%E A091802 More terms from _Ray Chandler_, Feb 22 2004