id:A082095 - OEIS Search Results

Search: id:A082095

Displaying 1-1 of 1 results found.

page 1

A082095

A 2nd order recursion: a(1)=a(2)=1; a(n)=p[a(n-2)]+Pi[a(n-1)]=A000040[a(n-2)]+A000720[a(n-1)].

+0
3

1, 1, 2, 3, 5, 8, 15, 25, 56, 113, 293, 679, 2036, 5389, 18447, 54920, 211347, 697252, 2974827, 10741681, 50245401, 196570892, 998427899, 4197026430, 22963115248 (list; graph; listen)

	OFFSET	`1,3`
	MATHEMATICA	`f[x_] := Prime[f[x-2]]+PrimePi[f[x-1]] {f[1]=1, f[2]=1}; Table[f[w], {w, 1, 25}]`
	CROSSREFS	`Cf. A069103, A082094.` `Sequence in context: A066372 A058519 A151518 this_sequence A006982 A054539 A026702` `Adjacent sequences: A082092 A082093 A082094 this_sequence A082096 A082097 A082098`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 11 2003`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research