A082096 - OEIS

This site is supported by donations to The OEIS Foundation.

A082096

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

1, 1, 3, 7, 29, 151, 1069, 9887, 115891, 1666421, 28700933, 580669933, 13578126713, 362075579539 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	MATHEMATICA	`f[x_] := Prime[f[x-2]+f[x-1]] {f[1]=1, f[2]=1}; Table[f[w], {w, 1, 25}]`
	CROSSREFS	`Cf. A069103, A082094, A082095.` `Sequence in context: A088095 A173280 A141477 * A119325 A048722 A061955` `Adjacent sequences: A082093 A082094 A082095 * A082097 A082098 A082099`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 11 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 04:48 EST 2012. Contains 205570 sequences.