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.

A235600 a(n) = n/d(n) if d(n) divides n, otherwise a(n) = n, where d(n) is the sum of the digits of n (A007953).

This page as a plain text file.
%I A235600 #18 Dec 06 2023 08:33:44
%S A235600 1,1,1,1,1,1,1,1,1,10,11,4,13,14,15,16,17,2,19,10,7,22,23,4,25,26,3,
%T A235600 28,29,10,31,32,33,34,35,4,37,38,39,10,41,7,43,44,5,46,47,4,49,10,51,
%U A235600 52,53,6,55,56,57,58,59,10,61,62,7,64,65,66,67,68,69,10,71,8,73,74,75,76,77,78,79,10,9,82,83,7,85
%N A235600 a(n) = n/d(n) if d(n) divides n, otherwise a(n) = n, where d(n) is the sum of the digits of n (A007953).
%H A235600 Paolo Xausa, <a href="/A235600/b235600.txt">Table of n, a(n) for n = 1..10000</a>
%t A235600 A235600[n_]:=With[{d=Total[IntegerDigits[n]]},If[Divisible[n,d],n/d,n]];
%t A235600 Array[A235600,100] (* _Paolo Xausa_, Dec 06 2023 *)
%o A235600 (PARI) a(n) = my(s=sumdigits(n)); if (n % s, n, n/s); \\ _Michel Marcus_, Jul 15 2021
%Y A235600 Cf. A007953, A235601, A235602.
%Y A235600 Cf. A065517 (first differs at n=15).
%K A235600 nonn,base
%O A235600 1,10
%A A235600 _N. J. A. Sloane_, Jan 18 2014