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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048478 a(n) = T(6,n), array T given by A048472. 1

%I

%S 1,8,29,85,225,561,1345,3137,7169,16129,35841,78849,172033,372737,

%T 802817,1720321,3670017,7798785,16515073,34865153,73400321,154140673,

%U 322961409,675282945,1409286145,2936012801,6106906625,12683575297

%N a(n) = T(6,n), array T given by A048472.

%H Vincenzo Librandi, <a href="/A048478/b048478.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = 7*n * 2^(n-1) + 1.

%o (MAGMA) [7*n * 2^(n-1) + 1: n in [0..30]]; // Vincenzo Librandi, Sep 23 2011

%Y n-th difference of a(n), a(n-1), ..., a(0) is (7, 14, 21, ...).

%K nonn,easy

%O 0,2

%A _Clark Kimberling_

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

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

Last modified September 30 05:01 EDT 2014. Contains 247417 sequences.