OFFSET
1,1
COMMENTS
A "nine digit anagram" is a (so-called restricted zeroless pandigital) number whose digits are a permutation of [1..9], i.e., one of the first 9! terms of A050289.
In total there are exactly 68 such palindromes, 437606734 is the largest.
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..68 (full sequence)
Patrick De Geest, Nine Digits Digressions
FORMULA
EXAMPLE
Denote by F(1,P) the Fibonacci type sequence x(n+1) = x(n) + x(n-1) with x(0) = 1, x(1) = P.
Then for P = a(8) = 9530359, F(1,P) = (1, 9530359, 9530360, 19060719, 28591079, 47651798, 76242877, 123894675, ...) where a 9-digits anagram has occurred.
PROG
(PARI) A034306=[p | p<-[A002113(n) | n<-[1..6*10^4]], is_A034587(p)] \\ All 68 terms in a fraction of a second. - M. F. Hasler, Jan 08 2020
CROSSREFS
KEYWORD
nonn,base,fini,full
AUTHOR
Patrick De Geest, Oct 15 1998
EXTENSIONS
Edited by M. F. Hasler, Jan 09 2020
STATUS
approved