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.

A086757 Smallest prime p such that n is a palindrome in base-p representation.

This page as a plain text file.
%I A086757 #27 Feb 13 2024 14:34:34
%S A086757 2,3,2,3,2,5,2,3,2,3,13,5,3,13,2,3,2,5,23,3,2,23,3,5,29,3,2,3,31,29,2,
%T A086757 7,2,37,37,5,41,37,41,3,5,13,47,43,2,5,53,7,53,7,2,3,59,17,59,3,5,59,
%U A086757 61,11,67,5,2,7,2,67,5,3,71,13,7,5,2,73,79,37,79,5,83,3,83,3,5,11,2
%N A086757 Smallest prime p such that n is a palindrome in base-p representation.
%C A086757 A016026(n) <= a(n) <= A007918(n).
%o A086757 (Python)
%o A086757 from sympy import sieve
%o A086757 from sympy.ntheory import is_palindromic
%o A086757 def a086757(n): return next(p for p in sieve if is_palindromic(n, p)) # _Dumitru Damian_, Jan 29 2024
%o A086757 (PARI) isok(p,n) = my(d=digits(n,p)); d == Vecrev(d);
%o A086757 a(n) = my(p=2); while (!isok(p,n), p=nextprime(p+1)); p; \\ _Michel Marcus_, Jan 30 2024
%Y A086757 Cf. A007918, A016026.
%Y A086757 Cf. A006995 (a(n)=2).
%K A086757 nonn,base
%O A086757 1,1
%A A086757 _Reinhard Zumkeller_, Aug 01 2003