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.

A029507 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 14 (most significant digit on right).

This page as a plain text file.
%I A029507 #18 Mar 13 2020 11:27:34
%S A029507 1,2,6,7,10,13,86,197,408,498,520,936,1362,1636,1716,1980,2392,6718,
%T A029507 7709,17498,89190,100463,120133,168169,177840,477984,493806,2648444,
%U A029507 3922637,5012137
%N A029507 Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 14 (most significant digit on right).
%C A029507 This sequence differs from A061943 in that all least significant zeros are kept during concatenation.
%C A029507 No more terms < 10^7. [_Lars Blomberg_, Oct 08 2011]
%H A029507 <a href="/index/N#concat">Index entries for related sequences</a>
%e A029507 See A029495 for example.
%t A029507 b = 14; c = {}; Select[Range[10^4], Divisible[FromDigits[c = Join[c, Reverse[IntegerDigits[#, b]]], b], #] &] (* _Robert Price_, Mar 13 2020 *)
%Y A029507 Cf. A029447-A029470, A029471-A029494, A029495-A029518, A029519-A029542, A061931-A061954, A061955-A061978.
%K A029507 nonn,base,more
%O A029507 1,2
%A A029507 _Olivier Gérard_
%E A029507 Edited and updated by Larry Reeves (larryr(AT)acm.org), Apr 12 2002
%E A029507 Additional comments and more terms from Larry Reeves (larryr(AT)acm.org), May 25 2001
%E A029507 a(26)-a(30) from _Lars Blomberg_, Oct 08 2011