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.

A214789 a(n) is the smallest k>=2 such that n divides A000045(k-1)+8.

This page as a plain text file.
%I A214789 #13 Nov 25 2014 13:58:29
%S A214789 2,4,2,7,4,10,8,7,2,4,5,19,6,10,18,7,25,19,13,37,8,25,31,19,38,34,19,
%T A214789 31,9,58,25,19,35,25,15,19,45,13,24,37,27,10,30,25,24,31,23,19,24,64,
%U A214789 67,49,61,19,15,31,67,37,20
%N A214789 a(n) is the smallest k>=2 such that n divides A000045(k-1)+8.
%H A214789 Charles R Greathouse IV, <a href="/A214789/b214789.txt">Table of n, a(n) for n = 1..10000</a>
%o A214789 (PARI) a(n)=my(k); while(((Mod([1,1;1,0],n))^k++)[1,2]!=-8, ); k+1 \\ _Charles R Greathouse IV_, Nov 25 2014
%Y A214789 Cf. A214783, A214784, A214785, A214786.
%K A214789 nonn
%O A214789 1,1
%A A214789 _Art DuPre_, Aug 03 2012
%E A214789 Definition corrected. - _R. J. Mathar_, Aug 09 2012