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.

A286839 Digits of one of the two 13-adic integers sqrt(-1) (digits 0, 1, ... , 9, 10, 11, 12 are used instead of 0, 1, ... , 9, A, B, C).

This page as a plain text file.
%I A286839 #25 Feb 17 2021 20:30:16
%S A286839 8,7,11,12,7,7,11,12,11,4,4,6,0,6,9,12,8,5,8,7,12,7,11,8,1,5,6,2,7,7,
%T A286839 7,3,6,2,6,10,7,12,12,10,1,5,5,12,5,7,0,9,8,10,3,6,5,10,0,5,6,11,7,12,
%U A286839 7,9,1,12,2,0,9,4,7,6,2,7,3,6,3,10,4,7,12,0,1
%N A286839 Digits of one of the two 13-adic integers sqrt(-1) (digits 0, 1, ... , 9, 10, 11, 12 are used instead of 0, 1, ... , 9, A, B, C).
%H A286839 Seiichi Manyama, <a href="/A286839/b286839.txt">Table of n, a(n) for n = 0..10000</a>
%F A286839 a(n) = 12 - A286838(n) for n > 0.
%o A286839 (Ruby)
%o A286839 def A(k, m, n)
%o A286839   d_ary = []
%o A286839   ary = [0]
%o A286839   a, mod = k, m
%o A286839   (n + 1).times{|i|
%o A286839     b = a % mod
%o A286839     d_ary << (b - ary[-1]) / m ** i
%o A286839     ary << b
%o A286839     a = b ** m
%o A286839     mod *= m
%o A286839   }
%o A286839   d_ary
%o A286839 end
%o A286839 def A286839(n)
%o A286839   A(8, 13, n)
%o A286839 end
%o A286839 p A286839(100)
%Y A286839 Digits of one of the two p-adic integers sqrt(-1): A210850 and A210851 (p=5), A286838 and this sequence (p=13).
%K A286839 nonn,base
%O A286839 0,1
%A A286839 _Seiichi Manyama_, Aug 01 2017
%E A286839 Keyword "base" added by _Jianing Song_, Feb 17 2021