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!)
A283677 a(n) = lcm(b(b(n)), b(n-b(n)+1)) where b(n) = A004001(n). 3
1, 1, 1, 2, 2, 2, 2, 6, 3, 12, 12, 4, 4, 4, 4, 20, 5, 30, 35, 35, 42, 24, 24, 56, 56, 56, 8, 8, 8, 8, 8, 72, 9, 90, 99, 36, 36, 60, 130, 70, 70, 154, 165, 165, 60, 60, 60, 195, 208, 208, 112, 112, 112, 240, 240, 240, 240, 16, 16, 16, 16, 16, 16, 272, 17, 306, 323, 340, 357, 357, 126, 198, 414, 72, 72, 456, 475, 494 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
See the order of certain subsequences in scatterplot link.
LINKS
FORMULA
a(n) = lcm(A004001(A004001(n)), A004001(A080677(n))). - Antti Karttunen, Mar 18 2017
EXAMPLE
a(4) = lcm(A004001(A004001(4)), A004001(4-A004001(4)+1)) = lcm(1, 2) = 2.
MATHEMATICA
b[1] = b[2] = 1; b[n_] := b[n] = b[b[n - 1]] + b[n - b[n - 1]]; Table[LCM[b[b[n]], b[n + 1 - b[n]]], {n, 1, 78}] (* Indranil Ghosh, Mar 14 2017 *)
PROG
(PARI) a=vector(1000); a[1]=a[2]=1; for(n=3, #a, a[n]=a[a[n-1]]+a[n-a[n-1]]); va = vector(1000, n, lcm(a[a[n]], a[n+1-a[n]]))
(Scheme) (define (A283677 n) (lcm (A004001 (A004001 n)) (A004001 (+ 1 (- n (A004001 n)))))) ;; (Code for A004001 given under that entry). - Antti Karttunen, Mar 18 2017
CROSSREFS
Cf. also A283470, A283673.
Sequence in context: A096625 A359072 A263455 * A355192 A260983 A103222
KEYWORD
nonn,look
AUTHOR
Altug Alkan, Mar 14 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 May 7 02:48 EDT 2024. Contains 372300 sequences. (Running on oeis4.)