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.

A060110 Numbers in Morse code, with 1 for a dot, 2 for a dash and 0 between digits/letters and then converted from base 3 to base 10.

This page as a plain text file.
%I A060110 #11 Jun 23 2020 05:49:53
%S A060110 242,161,134,125,122,121,202,229,238,241,117611,117530,117503,117494,
%T A060110 117491,117490,117571,117598,117607,117610,97928,97847,97820,97811,
%U A060110 97808,97807,97888,97915,97924,97927,91367,91286,91259,91250,91247
%N A060110 Numbers in Morse code, with 1 for a dot, 2 for a dash and 0 between digits/letters and then converted from base 3 to base 10.
%C A060110 The mentioned base 3 representation of the terms (digits 0, 1 and 2) is given in A060109. - _M. F. Hasler_, Jun 22 2020
%H A060110 Reinhard Zumkeller, <a href="/A060110/b060110.txt">Table of n, a(n) for n = 0..10000</a>
%F A060110 A007089(a(n)) = A060109(n). - _Reinhard Zumkeller_, Feb 20 2015
%e A060110 a(10) = 12222022222[base 3] = 117611[base 10] since 1 is ".----" and 0 is "-----".
%o A060110 (Haskell)
%o A060110 a060110 = t . a060109 where
%o A060110    t 0 = 0
%o A060110    t n = if n == 0 then 0 else 3 * t n' + d  where (n', d) = divMod n 10
%o A060110 -- _Reinhard Zumkeller_, Feb 20 2015
%o A060110 (PARI) apply( {A060110(n)=if(n>9, self()(n\10)*3^6)+fromdigits([1+(abs(k-n%10)>2)|k<-[3..7]],3)}, [0..39]) \\ _M. F. Hasler_, Jun 23 2020
%Y A060110 Cf. A008777, A059852, A060109.
%Y A060110 Cf. A007089.
%K A060110 base,nonn
%O A060110 0,1
%A A060110 _Henry Bottomley_, Feb 28 2001