For 1 < k <= n, let m be the largest number such that k^1, k^2, ... k^m are palindromes in base n. a(n) gives the smallest k which has the largest value of m.
(history;
published version)
LINKS
Christian Perfect, <a href="/A258757/b258757_1.txt">Table of n, a(n) for n = 2..1000</a>
Discussion
Mon Jun 22
00:16
OEIS Server: Installed new b-file as b258757.txt. Old b-file is now b258757_1.txt.
COMMENTS
Excluding repetitions, this is a permutation of the natural numbers excluding all perfect powers (i.e. , this sequence contains N if and only if N is in A007916). - Derek Orr, Jun 18 2015
COMMENTS
Excluding repetitions, this is a permutation of the natural numbers excluding all perfect powers (i.e. this sequence contains N if and only if N is a permutation of in A007916). - Derek Orr, Jun 18 2015
COMMENTS
This Excluding repetitions, this is a permutation of the natural numbers excluding all perfect powers (i.e. this is a permutation of A007916). - Derek Orr, Jun 18 2015
Discussion
Thu Jun 18
16:46
Derek Orr: Sorry. Like this?
Discussion
Thu Jun 18
16:40
Alois P. Heinz: This is NOT a permutation because we have repetitions here.
16:41
Alois P. Heinz: @Derek: Please change your comment.
COMMENTS
This is a permutation of the natural numbers excluding all perfect powers (i.e. this is a permutation of A007916). - Derek Orr, Jun 18 2015
