login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276413 Non-repdigit numbers k that divide A045876(k). 1

%I #38 Aug 15 2021 21:51:10

%S 370,407,481,518,592,629,2727,13008,14634,16260,19512,22764,29268,

%T 39024,87804,101010,102564,103896,104895,105820,108262,109890,113960,

%U 115830,116883,124740,125356,125874,126984,128205,129870,132275,134680,135135,136752

%N Non-repdigit numbers k that divide A045876(k).

%C A161020 is a subsequence.

%H Robert Israel, <a href="/A276413/b276413.txt">Table of n, a(n) for n = 1..373</a>

%e 2727 is a term because 2277 + 2727 + 2772 + 7227 + 7272 + 7722 = 29997 is divisible by 2727.

%p filter:= proc(x) local L, D, n, M, s, j;

%p L:= convert(x, base, 10);

%p D:= [seq(numboccur(j, L), j=0..9)];

%p if numboccur(0,D) = 9 then return false fi;

%p n:= nops(L);

%p M:= n!/mul(d!, d=D);

%p s:= add(j*D[j+1], j=0..9);

%p evalb(((10^n-1)*M/9/n*s) mod x = 0)

%p end proc:

%p select(filter, [$1..2*10^5]); # _Robert Israel_, Sep 12 2016

%o (PARI) A047726(n) = n=eval(Vec(Str(n))); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);

%o A055642(n) = #Str(n);

%o A007953(n) = sumdigits(n);

%o A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));

%o isA010785(n) = {1==#Set(digits(n))}

%o lista(nn) = for(n=1, nn, if(A045876(n) % n == 0 && !isA010785(n), print1(n", ")));

%Y Cf. A161020, A045876.

%K nonn,base

%O 1,1

%A _Altug Alkan_, Sep 05 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 2 07:19 EDT 2024. Contains 372178 sequences. (Running on oeis4.)