login
a(n) = Bell(n) + Fibonacci(n).
1

%I #16 Dec 06 2019 15:46:20

%S 1,2,3,7,18,57,211,890,4161,21181,116030,678659,4213741,27644670,

%T 190899699,1382959155,10480143134,82864871401,682076808743,

%U 5832742209238,51724158242137,474869816167697,4506715738465034,44152005855113003,445958869294851657,4638590332230074378

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

%H Harvey P. Dale, <a href="/A100388/b100388.txt">Table of n, a(n) for n = 0..500</a>

%p with(combinat): seq(bell(x)+fibonacci(x),x=0..30);

%t Table[Fibonacci[n]+BellB[n],{n,0,30}] (* _Harvey P. Dale_, May 20 2012 *)

%o (Sage) [bell_number(m) + fibonacci(m) for m in range(23)] # _Zerinvary Lajos_, Jul 06 2008

%Y Cf. A000110, A000045.

%K nonn

%O 0,2

%A _Jorge Coveiro_, Dec 30 2004