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.

A278440 Numbers n such that A244112(n) | n.

This page as a plain text file.
%I A278440 #11 Dec 16 2016 12:25:02
%S A278440 22,777,4444,68868,200000,303030,333000,333333,555555,660000,660660,
%T A278440 666666,700000,2332200,3131313,4444400,6060600,7007000,7700000,
%U A278440 9009790,9656955,9885585,11517771,14233221,14331231,14333110,14411040,15143331,15233221,15331231,15333110
%N A278440 Numbers n such that A244112(n) | n.
%C A278440 A244112(68868) = 3826 and 68868 / 3826 = 18.
%H A278440 Paolo P. Lava, <a href="/A278440/b278440.txt">Table of n, a(n) for n = 1..200</a>
%p A278440 with(numtheory): P:=proc(q) local a,b,c,d,j,k,n; for n from 1 to q do a:=sort(convert(n,base,10));
%p A278440 for k from 1 to trunc(nops(a)/2) do c:=a[k]; a[k]:=a[nops(a)-k+1]; a[nops(a)-k+1]:=c; od;  k:=1; b:=a[1]; c:=0;
%p A278440 for j from 2 to nops(a) do if a[j]=b then k:=k+1; else d:=10*k+b; c:=c*10^(ilog10(d)+1)+d; k:=1; b:=a[j]; fi; od;
%p A278440 d:=10*k+b; c:=c*10^(ilog10(d)+1)+d; if type(n/c,integer) then print(n); fi; od; end: P(10^99);
%t A278440 Select[Range[10^6], Divisible[#, FromDigits@ Flatten@ Map[IntegerDigits, DeleteCases[#, k_ /; First@ k == 0]] &@ Reverse@ MapIndexed[{#1, (First@ #2 - 1)} &, RotateRight@ DigitCount@ #]] &] (* _Michael De Vlieger_, Dec 12 2016 *)
%Y A278440 Cf. A237605, A244112, A278439, A278441.
%K A278440 nonn,easy,base
%O A278440 1,1
%A A278440 _Paolo P. Lava_, Nov 25 2016