Replacing each digit d in decimal expansion of n with d^2 yields a prime at each step when done recursively three times.

A316604

Replacing each digit d in decimal expansion of n with d^2 yields a prime at each step when done recursively three times.

Terms

    a(0) =11a(1) =101a(2) =131a(3) =133a(4) =1013a(5) =2111a(6) =2619a(7) =3173a(8) =3301a(9) =4111a(10) =5907a(11) =8463a(12) =9101a(13) =10033a(14) =10111a(15) =12881a(16) =13833a(17) =14021a(18) =14821a(19) =15443a(20) =16771a(21) =17501a(22) =17831a(23) =18621a(24) =21519a(25) =21567a(26) =28609a(27) =29309a(28) =31133a(29) =31233

External references