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.

A214793 a(n)= smallest k>=2 such that n divides Fibonacci(k-1)+13, or 0 if no such k exists.

This page as a plain text file.
%I A214793 #17 Apr 07 2025 13:41:18
%S A214793 2,2,4,5,4,6,2,5,6,15,0,23,8,2,4,5,9,6,0,17,7,0,18,0,17,8,30,23,0,15,
%T A214793 0,29,0,9,18,0,32,0,15,17,14,23,38,0,44,18,10,0,19,17,12,29,19
%N A214793 a(n)= smallest k>=2 such that n divides Fibonacci(k-1)+13, or 0 if no such k exists.
%Y A214793 Cf. A214787, A214788
%K A214793 nonn
%O A214793 1,1
%A A214793 _Art DuPre_, Aug 03 2012
%E A214793 Definition corrected. - _R. J. Mathar_, Aug 09 2012