login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082454 a(n)=p[n]+p[n-1]+a(n-1) and {a[0]=0,a[1]=0}. 2
0, 0, 5, 3, 9, 9, 15, 15, 21, 21, 31, 29, 39, 39, 45, 45, 55, 57, 63, 65, 73, 71, 81, 81, 91, 95, 103, 101, 109, 107, 115, 125, 133, 135, 141, 147, 153, 155, 165, 165, 175, 177, 183, 189, 195, 195, 201, 209, 225, 225, 231, 231, 241, 239, 253, 255, 265, 267, 273, 275 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

EXAMPLE

In fact only one initial value is needed.

If initial values were {a[0]=0,a[1]=1} then A014687 was obtained.

p[10]+p[11]=29+31=a[10]+a[11]=31+29 (order was reversed!).

If initial values were {a[0]=1,a[1]=2} then A000040, the prime number seq was obtained.

p[10]+p[11]=29+31=a[10]+a[11]=29+31 [identity..]].

Initial values {a[0]=1,a[1]=3} give A014686.

MATHEMATICA

g[x_] := Prime[x]+Prime[x-1]-g[x-1] g[0]=0; g[1]=0; Table[g[w], {w, 0, 100}]

CROSSREFS

Cf. A000040, A014686, A014687, A082455.

Sequence in context: A019955 A075693 A198134 * A108245 A141620 A195140

Adjacent sequences:  A082451 A082452 A082453 * A082455 A082456 A082457

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 25 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.