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!)
A323386 a(n) = b(n+1)/b(n) - 1 where b(1)=2 and b(k) = b(k-1) + lcm(floor(sqrt(2)*k),b(k-1)). 3
1, 1, 5, 7, 1, 3, 11, 1, 7, 5, 1, 1, 19, 7, 11, 1, 5, 13, 1, 29, 31, 1, 11, 1, 1, 19, 13, 41, 1, 43, 1, 23, 1, 1, 1, 13, 53, 1, 1, 19, 59, 1, 31, 1, 13, 1, 67, 23, 1, 1, 73, 1, 19, 1, 79, 1, 41, 83, 1, 43, 29, 89, 1, 13, 31, 47, 1, 97, 1, 1, 101, 103 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Conjectures:
1. This sequence consists only of 1's and primes.
2. Every odd prime of the form floor(sqrt(2)*m) is a term of this sequence.
3. At the first appearance of each prime of the form floor(sqrt(2)*m), it is the next prime after the largest prime that has already appeared.
LINKS
PROG
(PARI) Generator(n)={b1=2; list=[]; for(k=2, n, b2=b1+lcm(floor(sqrt(2)*k), b1); a=b2/b1-1; list=concat(list, a); b1=b2); print(list)}
CROSSREFS
Sequence in context: A019697 A217173 A246952 * A021179 A153613 A356706
KEYWORD
nonn
AUTHOR
Pedja Terzic, Jan 13 2019
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 23 05:37 EDT 2024. Contains 371906 sequences. (Running on oeis4.)