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!)
A283463 a(n) = A032742(A266645(n)). 4
1, 1, 1, 2, 1, 3, 1, 5, 3, 4, 1, 7, 1, 11, 5, 6, 1, 13, 1, 17, 7, 10, 1, 19, 5, 9, 11, 8, 1, 23, 1, 29, 13, 14, 7, 15, 1, 31, 17, 22, 1, 37, 1, 41, 19, 12, 1, 43, 7, 25, 9, 26, 1, 47, 11, 21, 23, 34, 1, 53, 1, 59, 29, 20, 13, 33, 1, 61, 15, 38, 1, 67, 1, 71, 31, 18, 11, 35, 1, 73, 37, 16, 1, 79, 17, 39, 41, 46, 1, 83, 13, 55, 43, 58, 19, 51 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10001

FORMULA

a(n) = A032742(A266645(n)).

a(n) = A266645(n) / A020639(n). [Because A266645 preserves the smallest prime factor of n.]

MATHEMATICA

f[n_] := Times @@ Power[Which[# == 1, 1, # == 2, 1, True, NextPrime[#, -1]] & /@ First@ #, Last@ #] &@ Transpose@ FactorInteger@ n; g[n_] := If[n == 1, 0, PrimePi@ FactorInteger[n][[1, 1]]]; Function[s, MapIndexed[Function[{m, n}, If[# == 1, 1, Divisors[#][[-2]]] &@ f[Lookup[s, g[n] + 1][[m]] - Boole[n == 1]]][#1, First@ #2] &, #] &@ Map[Position[Lookup[s, g@ #], #][[1, 1]] &, Range@ 120]]@ PositionIndex@ Array[g, 10^4] (* Michael De Vlieger, Mar 09 2017, Version 10 *)

PROG

(Scheme) (define (A283463 n) (A032742 (A266645 n)))

CROSSREFS

Cf. A020639, A032742, A266645, A280497, A280498, A283464, A283465.

Sequence in context: A065370 A147783 A214340 * A283464 A323184 A102614

Adjacent sequences:  A283460 A283461 A283462 * A283464 A283465 A283466

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 08 2017

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 October 2 08:07 EDT 2022. Contains 357191 sequences. (Running on oeis4.)