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!)
A372607 Let a(1) = 2, f(n) = a(1)*a(2)*...*a(n-1) for n >= 1 and a(n) = nextludicnumber(f(n)+1) - f(n) for n >= 2, where nextludicnumber(x) is the smallest ludic number > x. 0

%I #13 May 19 2024 12:09:21

%S 2,3,5,7,11,23,13,25,17

%N Let a(1) = 2, f(n) = a(1)*a(2)*...*a(n-1) for n >= 1 and a(n) = nextludicnumber(f(n)+1) - f(n) for n >= 2, where nextludicnumber(x) is the smallest ludic number > x.

%C Conjecture: every element is a ludic number.

%Y Cf. A067836, A003309 (ludic numbers).

%K nonn,more

%O 1,1

%A _Davide Rotondo_, May 07 2024

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 August 4 18:10 EDT 2024. Contains 374923 sequences. (Running on oeis4.)