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.

A072051 Smallest k such that gcd(k, reverse(k)) = 11^n.

This page as a plain text file.
%I A072051 #11 Sep 02 2024 17:02:07
%S A072051 11,121,1331,14641,121110352,1332213872,105923336431682,
%T A072051 4676049710123077,36606937477221265,30983951005022964839,
%U A072051 1365869521861436622239
%N A072051 Smallest k such that gcd(k, reverse(k)) = 11^n.
%F A072051 a(n) = A069554(11^n).
%e A072051 a(8) = 4676049710123077 = (11^8)*13*1678009, reverse(a(8)) = 7703210179406764 = (11^8)*2*2*157*57223.
%Y A072051 Cf. A004086, A055483, A069554, A071686 (=2^n), A072005 (=3^n), A072021 (=5^n), A072050 (=7^n).
%K A072051 base,nonn
%O A072051 1,1
%A A072051 _Labos Elemer_, Jun 10 2002
%E A072051 a(9)-a(11) from _Sean A. Irvine_, Sep 02 2024