login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324322 Numbers k such that Ld(k) == k (mod Rd(k)), where Ld(k) = A067080 and Rd(k) = A067079. 2
12, 13, 14, 15, 16, 17, 18, 19, 32, 43, 52, 54, 65, 72, 73, 76, 87, 92, 94, 98, 103, 352, 461, 571, 792, 803, 1003 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
No other term up to 2*10^10. - Giovanni Resta, Feb 22 2019
LINKS
EXAMPLE
Ld(792) = 792*79*7 = 437976, Rd(792) = 792*92*2 = 145728 and 437976 == 792 (mod 145728).
MAPLE
with(numtheory): P:=proc(n) local a, k;
a:=mul(n mod 10^k, k=1..ilog10(n)+1): if a>0 then
if n=mul(trunc(n/10^k), k=0..ilog10(n)) mod a then n;
fi; fi; end: seq(P(i), i=1..1100);
MATHEMATICA
Select[Range[10^6], If[#2 != 0, Mod[Times @@ Map[FromDigits, NestWhileList[Most@ # &, IntegerDigits@ #1, Length@ # > 1 &]], #2] == #1] & @@ {#, Times @@ Map[FromDigits, NestWhileList[Rest@ # &, IntegerDigits@ #, Length@ # > 1 &]]} &] (* Michael De Vlieger, Feb 25 2019 *)
PROG
(PARI) Ld(n) = my(t=n); while(n\=10, t*=n); t; \\ A067080
Rd(n) = prod(k=1, logint(n+!n, 10)+1, n-n\10^k*10^k); \\ A067079
isok(k) = if (k % 10, (Ld(k) % Rd(k)) == k); \\ Michel Marcus, Jan 15 2023
CROSSREFS
Sequence in context: A296713 A297146 A267761 * A083826 A343888 A331214
KEYWORD
nonn,more
AUTHOR
Paolo P. Lava, Feb 22 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)