login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116454 Smallest m such that A116452(m) = n. 3

%I #11 Jul 31 2015 18:15:24

%S 0,2,9,25,59,129,271,557,1131,2281,4583,9189,18403,36833,73695,147421,

%T 294875,589785,1179607,2359253,4718547,9437137,18874319,37748685,

%U 75497419,150994889,301989831,603979717,1207959491,2415919041

%N Smallest m such that A116452(m) = n.

%C A116451(a(n)) = A116453(n);

%C Primes include a(2) = 2, a(5) = 59, a(7) = 271, a(8) = 557, a(10) = 2281, a(11) = 4583, a(14) = 36833. - _Jonathan Vos Post_, Feb 20 2006

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (4, -5, 2).

%F a(n+1) = (a(n) + n) * 2 + 1 for n>1.

%F a(0)=0, a(1)=2, a(2)=9, a(3)=25, a(n)=4*a(n-1)-5*a(n-2)+2*a(n-3) [From Harvey P. Dale, Jul 18 2011]

%F G.f.: ((x-2)*x*(x+1))/((x-1)^2*(2*x-1)) [From Harvey P. Dale, Jul 18 2011]

%t Join[{0},RecurrenceTable[{a[1]==2,a[n]==2(a[n-1]+n)+1},a[n],{n,30}]] (* or *) Join[{0},LinearRecurrence[{4,-5,2},{2,9,25},30]] (* _Harvey P. Dale_, Jul 18 2011 *)

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Feb 16 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)