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!)
A069899 Integer quotient of largest and smallest prime factors of n is 1. 1
2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19, 23, 24, 25, 27, 29, 31, 32, 35, 36, 37, 41, 43, 45, 47, 48, 49, 53, 54, 59, 61, 64, 67, 71, 72, 73, 75, 77, 79, 81, 83, 89, 91, 96, 97, 101, 103, 107, 108, 109, 113, 121, 125, 127, 128, 131, 135, 137, 139, 143, 144 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..66.

FORMULA

A069897(n)=Floor[P/p]=1, where P is the largest, p is the least prime-factor of n.

EXAMPLE

Beside primes and prime powers, composite like 96 is here because Floor[3/2]=1.

CROSSREFS

Cf. A069897.

Sequence in context: A193671 A073491 A066311 * A081306 A130073 A133812

Adjacent sequences:  A069896 A069897 A069898 * A069900 A069901 A069902

KEYWORD

nonn

AUTHOR

Labos Elemer, Apr 10 2002

STATUS

approved

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 March 30 10:31 EDT 2020. Contains 333125 sequences. (Running on oeis4.)