Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122039
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122039 a(n) = 2*a(n-1) - n + 4 for n>1, a(1)=1. +0
1
1, 4, 9, 18, 35, 68, 133, 262, 519, 1032, 2057, 4106, 8203, 16396, 32781, 65550, 131087, 262160, 524305, 1048594, 2097171, 4194324, 8388629, 16777238, 33554455, 67108888, 134217753, 268435482, 536870939, 1073741852, 2147483677 (list; graph; listen)
OFFSET

1,2

COMMENT

From a quiz.

LINKS

C. P. Simoes, Teste de Desempenho Mental.

FORMULA

a(n)=A083706(n-1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 02 2008]

a(n)=2^n+n-2, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Oct 01 2008]

EXAMPLE

1x2 + (2) = 4; 4x2 + (1) = 9; 9x2 + (0) = 18; 18x2 + (-1) = 35; 35x2 + (-2) = 68

PROGRAM

(PARI) a(n)=if(n>1, 2*a(n-1)+(4-n), 1) for(n=1, 40, print1(a(n), ", "))

CROSSREFS

Sequence in context: A019453 A038089 A027053 this_sequence A083706 A074896 A015713

Adjacent sequences: A122036 A122037 A122038 this_sequence A122040 A122041 A122042

KEYWORD

nonn

AUTHOR

Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 14 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research