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.

A107128 Divide the even digits of n by 2!.

This page as a plain text file.
%I A107128 #13 Apr 08 2022 10:47:15
%S A107128 0,1,1,3,2,5,3,7,4,9,10,11,11,13,12,15,13,17,14,19,10,11,11,13,12,15,
%T A107128 13,17,14,19,30,31,31,33,32,35,33,37,34,39,20,21,21,23,22,25,23,27,24,
%U A107128 29,50,51,51,53,52,55,53,57,54,59,30,31,31,33,32,35,33,37,34,39,70,71,71
%N A107128 Divide the even digits of n by 2!.
%C A107128 Differs from A026741 starting with 11-term term: A107128(11)=10, A026741(11)=5.
%H A107128 Reinhard Zumkeller, <a href="/A107128/b107128.txt">Table of n, a(n) for n = 0..10000</a>
%t A107128 A107128[n_]:=FromDigits[Map[If[Mod[ #, 2]==0, #/2, # ]&, IntegerDigits[n]]]
%t A107128 Table[FromDigits[If[EvenQ[#],#/2,#]&/@IntegerDigits[n]],{n,0,80}] (* _Harvey P. Dale_, Sep 03 2018 *)
%o A107128 (Haskell)
%o A107128 a107128 n = if n == 0 then 0 else 10 * (a107128 n') + m * d + (1 - m) * d'
%o A107128             where (d', m) = divMod d 2
%o A107128                   (n', d) = divMod n 10
%o A107128 -- _Reinhard Zumkeller_, Jan 14 2015
%o A107128 (Python)
%o A107128 def A107128(n): return int(str(n).translate({50:49,52:50,54:51,56:52})) # _Chai Wah Wu_, Apr 08 2022
%Y A107128 Cf. A026741.
%Y A107128 Cf. A106747.
%K A107128 nonn,base,look
%O A107128 0,4
%A A107128 _Zak Seidov_, May 12 2005