login
a(n) = prime(n) + Fibonacci(n).
4

%I #14 Apr 21 2023 23:42:47

%S 3,4,7,10,16,21,30,40,57,84,120,181,274,420,657,1040,1656,2645,4248,

%T 6836,11019,17790,28740,46457,75122,121494,196521,317918,514338,

%U 832153,1346396,2178440,3524715,5703026,9227614,14930503,24157974,39088332,63246153

%N a(n) = prime(n) + Fibonacci(n).

%D GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See page 79.

%p with(combinat): f := n -> fibonacci(n) + ithprime(n);

%t Table[Fibonacci[n] + Prime[n], {n, 35}]

%o (Magma) [NthPrime(n)+Fibonacci(n): n in [1..50]]; // _Vincenzo Librandi_, Jul 29 2016

%Y Cf. A100700.

%K nonn

%O 1,1

%A Hegermann, Frank (hegermann(AT)oi.dbv.commerzbank.dbp.de)