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.

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