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!)
A262401 In prime factorization of n: replace each factor with its largest decimal digit. 4

%I

%S 1,2,3,4,5,6,7,8,9,10,1,12,3,14,15,16,7,18,9,20,21,2,3,24,25,6,27,28,

%T 9,30,3,32,3,14,35,36,7,18,9,40,4,42,4,4,45,6,7,48,49,50,21,12,5,54,5,

%U 56,27,18,9,60,6,6,63,64,15,6,7,28,9,70,7,72,7,14

%N In prime factorization of n: replace each factor with its largest decimal digit.

%C a(n) = product(A054055(A027746(n,k)): k=1..A001222(n));

%C a(n) <= n;

%C a(m) = m iff m is 7-smooth: a(A002473(n)) = A002473(n) and a(A068191(n)) < A068191(n);

%C A006530(a(n)) <= 7;

%C a(a(n)) = a(n).

%H Reinhard Zumkeller, <a href="/A262401/b262401.txt">Table of n, a(n) for n = 1..10000</a>

%F Multiplicative with p -> A054055(p), p prime.

%o (Haskell)

%o a262401 = product . map a054055 . a027746_row'

%Y Cf. A054055, A027746, A001222, A002473, A006530, A060418, A068191.

%K nonn,base,mult

%O 1,2

%A _Reinhard Zumkeller_, Sep 25 2015

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 June 17 17:01 EDT 2021. Contains 345085 sequences. (Running on oeis4.)