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!)
A191616 a(1) = 1; a(n) is the largest number m such that m-A085392(m) = a(n-1). 1
1, 2, 4, 5, 10, 15, 20, 25, 30, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Lexicographically largest sequence such that a(n) - a(n-1) is the largest noncomposite divisor <a(n) of a(n).
Sequence is finite with 10 terms.
(The reason is that m-A085392(m) = 0, 1, 2, 2, 4, 3, 6, 6, 6, 5, 10, 9, 12, 7,.. starts to grow with a lower bound of m/2, and a(10)=32 is not in its list of values.)
LINKS
CROSSREFS
Sequence in context: A097133 A023165 A058299 * A319909 A276281 A059994
KEYWORD
nonn,fini,full
AUTHOR
Jaroslav Krizek, Jun 09 2011
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 19 07:38 EDT 2024. Contains 371782 sequences. (Running on oeis4.)