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.

A109032 a(n) is the largest number such that when written in base n, for each possible k, the number having the first k digits of a(n) is divisible by k.

This page as a plain text file.
%I A109032 #13 Oct 19 2017 03:14:42
%S A109032 2,510,10801,8002800,328224963,543132112659030,1625617313969282,
%T A109032 976950495904635536636,3608528850368400786036725,
%U A109032 633984966211379026884314402,830642837707972528309709136652,311178293035966860075741106050464008245,418859156568815767928583230192107024079856024
%N A109032 a(n) is the largest number such that when written in base n, for each possible k, the number having the first k digits of a(n) is divisible by k.
%C A109032 This is not monotonic: a(14) > a(15).
%H A109032 Karl W. Heuer, <a href="/A109032/b109032.txt">Table of n, a(n) for n = 2..32</a>
%H A109032 MathStackExchange, <a href="http://math.stackexchange.com/questions/411897/find-the-largest-number-having-this-property">Find the largest number having this property</a>, Jan 2013.
%H A109032 A. Mihailovs, <a href="http://beta.mapleprimes.com/blog/alec/ponder_this">Ponder This</a>.
%H A109032 smit0399, <a href="http://home.kpn.nl/smit0399/3608528850368400786036725.htm">veeldeelbaarheid</a> (in Dutch).
%Y A109032 Cf. A109783.
%K A109032 nonn,base
%O A109032 2,1
%A A109032 _Don Reble_, Aug 17 2005
%E A109032 a(13)-a(32) from _Karl W. Heuer_, Jan 08 2015