login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..52.

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

Adjacent sequences:  A056047 A056048 A056049 * A056051 A056052 A056053

KEYWORD

easy,nonn,base

AUTHOR

Robert G. Wilson v, Jul 25 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 07:58 EDT 2021. Contains 346435 sequences. (Running on oeis4.)