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!)
A273223 a(n) = p*(p - 1)*(501*p^3 - 414*p^2 + 111*p - 54)/120, where p = prime(n). 2

%I #15 Sep 08 2022 08:46:16

%S 42,504,8796,53298,566412,1341756,5312160,9373536,24790458,80346588,

%T 112613886,275440284,462452448,588037212,920759046,1686448764,

%U 2893307844,3421602972,5484429720,7340452434,8440231968,12551864598,16086117120,22838112000,35181089856

%N a(n) = p*(p - 1)*(501*p^3 - 414*p^2 + 111*p - 54)/120, where p = prime(n).

%H Seiichi Manyama, <a href="/A273223/b273223.txt">Table of n, a(n) for n = 1..10000</a>

%H F. V. Weinstein, <a href="http://arXiv.org/abs/math.NT/0307150">Notes on Fibonacci partitions</a>, arXiv:math/0307150 [math.NT], 2003-2015, page 22.

%t Table[p = Prime[n]; p (p - 1) (501 p^3 - 414 p^2 + 111 p - 54) / 120, {n, 40}]

%o (Magma) [p*(p-1)*(501*p^3-414*p^2+111*p-54)/120: p in PrimesUpTo(200)];

%Y Cf. A006093, A008837, A179545, A273221, A273222.

%K nonn

%O 1,1

%A _Vincenzo Librandi_, May 19 2016

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 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)