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.

A276413 Non-repdigit numbers k that divide A045876(k).

This page as a plain text file.
%I A276413 #38 Aug 15 2021 21:51:10
%S A276413 370,407,481,518,592,629,2727,13008,14634,16260,19512,22764,29268,
%T A276413 39024,87804,101010,102564,103896,104895,105820,108262,109890,113960,
%U A276413 115830,116883,124740,125356,125874,126984,128205,129870,132275,134680,135135,136752
%N A276413 Non-repdigit numbers k that divide A045876(k).
%C A276413 A161020 is a subsequence.
%H A276413 Robert Israel, <a href="/A276413/b276413.txt">Table of n, a(n) for n = 1..373</a>
%e A276413 2727 is a term because 2277 + 2727 + 2772 + 7227 + 7272 + 7722 = 29997 is divisible by 2727.
%p A276413 filter:= proc(x) local L, D, n, M, s, j;
%p A276413   L:= convert(x, base, 10);
%p A276413   D:= [seq(numboccur(j, L), j=0..9)];
%p A276413   if numboccur(0,D) = 9 then return false fi;
%p A276413   n:= nops(L);
%p A276413   M:= n!/mul(d!, d=D);
%p A276413     s:= add(j*D[j+1], j=0..9);
%p A276413   evalb(((10^n-1)*M/9/n*s) mod x = 0)
%p A276413 end proc:
%p A276413 select(filter, [$1..2*10^5]); # _Robert Israel_, Sep 12 2016
%o A276413 (PARI) A047726(n) = n=eval(Vec(Str(n))); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);
%o A276413 A055642(n) = #Str(n);
%o A276413 A007953(n) = sumdigits(n);
%o A276413 A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));
%o A276413 isA010785(n) = {1==#Set(digits(n))}
%o A276413 lista(nn) = for(n=1, nn, if(A045876(n) % n == 0 && !isA010785(n), print1(n", ")));
%Y A276413 Cf. A161020, A045876.
%K A276413 nonn,base
%O A276413 1,1
%A A276413 _Altug Alkan_, Sep 05 2016