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

%I #6 Jul 12 2019 17:35:33

%S 2,3,14,22,52,74,149,199,360,436,764,922,1567,1815,3022,3540,5834,

%T 6724,10999,12157,19804,22204,36080,39262,63703,68697,111344,121702,

%U 197120,215424,348789,375335,607552,642398,1039688,1112246,1799935,1899149

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

%K nonn

%O 1,1

%A _Clark Kimberling_

%E a(33) corrected by _Sean A. Irvine_, Jul 12 2019

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 25 08:20 EDT 2024. Contains 371964 sequences. (Running on oeis4.)