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.

A363038 The decimal digits of a(n) correspond to the Gilbreath transform of the decimal digits of n.

This page as a plain text file.
%I A363038 #13 May 20 2023 13:39:56
%S A363038 0,1,2,3,4,5,6,7,8,9,11,10,11,12,13,14,15,16,17,18,22,21,20,21,22,23,
%T A363038 24,25,26,27,33,32,31,30,31,32,33,34,35,36,44,43,42,41,40,41,42,43,44,
%U A363038 45,55,54,53,52,51,50,51,52,53,54,66,65,64,63,62,61,60,61
%N A363038 The decimal digits of a(n) correspond to the Gilbreath transform of the decimal digits of n.
%C A363038 Leading zeros are ignored.
%C A363038 This sequence preserves the number of digits (A055642) as well as the initial digit (A000030).
%H A363038 Rémy Sigrist, <a href="/A363038/b363038.txt">Table of n, a(n) for n = 0..10000</a>
%H A363038 N. J. A. Sloane, <a href="/A362451/a362451_2.txt">Maple code for Gilbreath transform and related arrays</a>
%e A363038 For n = 1029: the Gilbreath transform of (1 0 2 9) is (1 1 1 4), so a(1029) = 1114.
%t A363038 A363038[n_]:=Module[{d=IntegerDigits[n]},FromDigits[Join[{First[d]},Table[First[d=Abs[Differences[d]]],Length[d]-1]]]];Array[A363038,200,0] (* _Paolo Xausa_, May 19 2023 *)
%o A363038 (PARI) a(n, base = 10) = { my (d = digits(n, base), t = vector(#d)); for (i = 1, #d, t[i] = d[1]; d = vector(#d-1, j, abs(d[j+1]-d[j]));); fromdigits(t, base); }
%Y A363038 Cf. A000030, A055642, A334727 (base-2 analog).
%K A363038 nonn,base,easy
%O A363038 0,3
%A A363038 _Rémy Sigrist_, May 14 2023