login
This site is supported by donations to The OEIS 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; internal format)
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: A015820 A096728 A011985 * A035111 A035282 A075156

Adjacent sequences:  A056047 A056048 A056049 * A056051 A056052 A056053

KEYWORD

easy,nonn,base

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 25 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 21:09 EST 2012. Contains 205561 sequences.