login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A056050
Semimorphic numbers: n^2 mod the number of digits in n = n^3 mod the number of digits in n.
0
1, 5, 6, 10, 20, 25, 26, 30, 40, 45, 50, 60, 65, 70, 76, 80, 85, 90, 100, 200, 225, 300, 376, 400, 425, 500, 600, 625, 700, 800, 825, 876, 900, 1000, 1025, 1100, 1200, 1300, 1400, 1425, 1500, 1600, 1700, 1800, 1825, 1876, 1900, 2000, 2100, 2200, 2225, 2300
OFFSET
1,2
MATHEMATICA
Do[l = Floor[N[Log[10, n], 24]] + 1; If[Mod[n^2, 10^l] == Mod[n^3, 10^l], Print[n]], {n, 1, 5000}]
CROSSREFS
Cf. A003226.
Sequence in context: A231503 A254227 A326806 * A274554 A035111 A035282
KEYWORD
easy,nonn,base
AUTHOR
Robert G. Wilson v, Jul 25 2000
STATUS
approved