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!)
A025098 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (primes). 0

%I #5 Dec 29 2023 23:38:19

%S 3,5,22,32,74,100,199,239,436,530,922,1074,1815,2129,3540,4086,6724,

%T 7432,12157,13635,22204,24166,39262,42342,68697,75095,121702,133012,

%U 215424,231818,375335,396863,642398,687230,1112246,1173552,1899149,1999177

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (primes).

%F a(n) = Sum_{k=1..floor((n+1)/2)} Lucas(k) * prime(n-k+2). - _Wesley Ivan Hurt_, Dec 29 2023

%t Table[Sum[LucasL[k] Prime[n - k + 2], {k, Floor[(n + 1)/2]}], {n, 60}] (* _Wesley Ivan Hurt_, Dec 29 2023 *)

%K nonn

%O 1,1

%A _Clark Kimberling_

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 July 2 10:22 EDT 2024. Contains 373956 sequences. (Running on oeis4.)