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.

A276802 Non-repdigit numbers n such that A045876(n) ends with n.

This page as a plain text file.
%I A276802 #31 Mar 13 2019 23:41:54
%S A276802 554,3328,55553,77764,222221,444442,666663,888865,888884,5555552,
%T A276802 6666595,9999840,33332680,55555526,66666557,99998670,333332176,
%U A276802 333333312,555555551,666665752,666666624,999997536,999999936,9999976480,9999997844,9999999668,9999999923,11111111110
%N A276802 Non-repdigit numbers n such that A045876(n) ends with n.
%H A276802 David A. Corneth, <a href="/A276802/a276802.gp.txt">Pari Program.</a>
%e A276802 554 is a term because 455+545+554 = 1554 that ends with 554.
%e A276802 2338 is the least term having its digits. For all permutations p of digits of n, in this case 2338, (without leading zeros if any), A045876(n) = A045876(p). A045876(2338) = 53328. It contains the digits of 2338 and ends with its digits permuted. 2338 has 4 digits, as has 53328 mod 10^4 so 53328 mod 10^4 == 3328 is a term. - _David A. Corneth_, Oct 04 2016
%o A276802 (PARI) A047726(n) = n=eval(Vec(Str(n))); (#n)!/prod(i=0, 9, sum(j=1, #n, n[j]==i)!);
%o A276802 A055642(n) = #Str(n);
%o A276802 A007953(n) = sumdigits(n);
%o A276802 A045876(n) = ((10^A055642(n)-1)/9)*(A047726(n)*A007953(n)/A055642(n));
%o A276802 isA010785(n) = {1==#Set(digits(n))}
%o A276802 is(n) = (A045876(n)-n) % 10^A055642(n) == 0 && !isA010785(n)
%Y A276802 Cf. A045876, A139819 (non-repdigits), A179239.
%K A276802 nonn,base
%O A276802 1,1
%A A276802 _Altug Alkan_, Sep 17 2016
%E A276802 More terms from _David A. Corneth_, Oct 06 2016