A066825 a(1) = 1; set of digits of a(n)^2 is a subset of the set of digits of a(n+1)^2.

1, 4, 13, 14, 31, 36, 54, 96, 113, 311, 487, 854, 1036, 1277, 1646, 3214, 3267, 3723, 4047, 4554, 4896, 5376, 10136, 13147, 13268, 16549, 20513, 21877, 25279, 26152, 27209, 28582, 31723, 32043, 32286, 33144, 35172, 35337, 35757, 35853

Offset: 1

Author

David W. Wilson, Feb 05 2002

Keywords

• nonn
• base

Comments

Probably infinite and dense over Z+.

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A014563, A067633, A067634, A067635.

Cf. A000290, A000196.

Programs

Haskell

import Data.List ((\\))
a066825 n = a066825_list !! (n-1)
a066825_list = 1 : f 1 (drop 2 a000290_list) where
   f x (q:qs) | all (`elem` show q) xs = y : f y qs
              | otherwise              = f x qs
              where y = a000196 q; xs = show (x * x)
-- Reinhard Zumkeller, Nov 22 2012