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

%I

%S 1,5,6,10,20,25,26,30,40,45,50,60,65,70,76,80,85,90,100,200,225,300,

%T 376,400,425,500,600,625,700,800,825,876,900,1000,1025,1100,1200,1300,

%U 1400,1425,1500,1600,1700,1800,1825,1876,1900,2000,2100,2200,2225,2300

%N Semimorphic numbers: n^2 mod the number of digits in n = n^3 mod the number of digits in n.

%t 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}]

%Y Cf. A003226.

%K easy,nonn,base

%O 1,2

%A _Robert G. Wilson v_, Jul 25 2000

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 September 22 03:20 EDT 2021. Contains 347605 sequences. (Running on oeis4.)