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.

A200582 a(n) = gcd(t(n), t(n-1)), where t is A200218.

This page as a plain text file.
%I A200582 #13 Aug 02 2019 04:11:18
%S A200582 297,36531,548111421,67965852735,1019760202547361,126450333081725499,
%T A200582 1897261817318411934357,235260591797816161585767,
%U A200582 3529851816596251006844782425,437701860518526922664914606467,6567282245071794543915385600213293,814343436090763041972430479341054799
%N A200582 a(n) = gcd(t(n), t(n-1)), where t is A200218.
%C A200582 This sequence allows us to find periods in A200218 and understand better A200218 and whole Danilov sequence.
%Y A200582 Cf. A200218, A200581.
%K A200582 nonn
%O A200582 1,1
%A A200582 _Artur Jasinski_, Nov 19 2011