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.

A060947 Intrinsic 10-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.

This page as a plain text file.
%I A060947 #11 Oct 31 2015 14:49:05
%S A060947 513,561,585,633,645,693,717,765,771,819,843,891,903,951,975,1023,
%T A060947 19684,20008,20332,20440,20764,21088,21196,21520,21844,21880,22204,
%U A060947 22528,22636,22960,23284,23392,23716,24040,24076,24400,24724,24832
%N A060947 Intrinsic 10-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
%C A060947 See A060873 for more information.
%H A060947 Peter Kagey, <a href="/A060947/b060947.txt">Table of n, a(n) for n = 1..10000</a>
%t A060947 testQ[n_, k_] := For[b = 2, b <= Ceiling[(n-1)^(1/(k-1))], b++, d = IntegerDigits[n, b]; If[Length[d] == k && d == Reverse[d], Return[True]]]; n0[k_] := 2^(k-1) + 1; Reap[Do[If[testQ[n, 10] === True, Print[n, " ", FromDigits[d], " b = ", b]; Sow[n]], {n, n0[10], 25000}]][[2, 1]] (* _Jean-François Alcover_, Nov 07 2014 *)
%Y A060947 Cf. A060873-A060879.
%K A060947 nonn,base
%O A060947 1,1
%A A060947 _Harvey P. Dale_, May 08 2001