|
Search: id:A107240
|
|
| |
|
| 1, 2, 3, 12, 37, 118, 407, 1368, 4617, 15642, 52891, 178916, 605325, 2047726, 6927407, 23435376, 79281105, 268206130, 907335091, 3069492092, 10384017717, 35128880742, 118840150983, 402033352264, 1360069089113, 4601080768074
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) is prime for n = 2, 3, 5, 15, 29, ... a(n) is semiprime for n = 7, 11, 21, 33, ... For Fibonacci numbers (A000045) F(i) we have SUM[from i=1 to n]F(i) = F(n)*F(n+1).
|
|
REFERENCES
|
M. Feinberg, "Fibonacci-Tribonacci." Fib. Quart. 1, 71-74, 1963.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Tribonacci Number..
|
|
FORMULA
|
a(n) = SUM[from i=1 to n][A000213(i)]^2.
|
|
EXAMPLE
|
a(1) = 1^2 = 1.
a(2) = 1^2 + 1^2 = 1.
a(3) = 1^2 + 1^2 + 1^2 = 3, prime.
a(4) = 1^2 + 1^2 + 1^2 + 3^2 = 12.
a(5) = 1^2 + 1^2 + 1^2 + 3^2 + 5^2 = 37, prime.
a(6) = 1^2 + 1^2 + 1^2 + 3^2 + 5^2 + 9^2 = 118 = 2 * 59, semiprime.
a(7) = 1^2 + 1^2 + 1^2 + 3^2 + 5^2 + 9^2 + 17^2 = 407 = 11 * 37, semiprime.
|
|
CROSSREFS
|
Cf. A000213, A107240, A107239-A107248.
Adjacent sequences: A107237 A107238 A107239 this_sequence A107241 A107242 A107243
Sequence in context: A076424 A072440 A135522 this_sequence A099171 A012307 A012311
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost2(AT)yahoo.com), May 14 2005
|
|
|
Search completed in 0.002 seconds
|
