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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083163 Define a function f(k) by f(k) = (k*a*b*c...)/{d*e*f...), where a,b,c,...are those nonzero digits of k which do not divide k and d,e,f,... are those nonzero digits of k which divide k. a(n) = Floor[f(k)]. 0

%I #11 Aug 17 2019 02:29:20

%S 1,1,1,1,1,1,1,1,1,10,11,6,39,56,3,96,119,144,171,10,42,5,138,3,10,78,

%T 378,112,522,10,93,48,3,408,21,2,777,912,117,10,164,84,516,2,36,1104,

%U 1316,1,1764,10,255,130,795,1080,2,1680,1995,2320,2655,10,366

%N Define a function f(k) by f(k) = (k*a*b*c...)/{d*e*f...), where a,b,c,...are those nonzero digits of k which do not divide k and d,e,f,... are those nonzero digits of k which divide k. a(n) = Floor[f(k)].

%C k = 22 is the first case for which f(k) is not an integer itself.

%o (PARI) a(n) = my (f=n, d=digits(n)); for (i=1, #d, if (d[i], if (n%d[i], f*=d[i], f/=d[i]))); floor(f) \\ _Rémy Sigrist_, Aug 16 2019

%K base,nonn

%O 1,10

%A _Amarnath Murthy_, Apr 25 2003

%E a(2)-a(9) corrected and more terms from _Rémy Sigrist_, Aug 16 2019

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.

Last modified December 3 22:01 EST 2023. Contains 367540 sequences. (Running on oeis4.)