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!)
A191615 a(1) = 1; a(n) is the smallest number such that a(n)-a(n-1) = A085392 (m), where A085392(m) is the largest noncomposite divisor <m of m. 1
1, 2, 3, 6, 7, 14, 16, 17, 34, 51, 54 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Sequence is finite with 11 terms.
Lexicographically earliest sequence such that the first differences a(n) - a(n-1) are the largest noncomposite divisor <a(n) of a(n).
LINKS
CROSSREFS
Sequence in context: A075427 A075426 A359041 * A018606 A117087 A322367
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 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)