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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160191 Lodumo_8 of Lucas numbers. 0

%I

%S 2,1,3,4,7,11,10,5,15,12,19,23,18,9,27,20,31,35,26,13,39,28,43,47,34,

%T 17,51,36,55,59,42,21,63,44,67,71,50,25,75,52,79,83,58,29,87,60,91,95,

%U 66,33,99,68,103,107,74,37,111,76,115,119,82,41,123,84,127,131,90,45,135

%N Lodumo_8 of Lucas numbers.

%C Numbers congruent to {0,6} mod 8 are missing (see A047451).

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%F Lodumo_8 transform of A000032 (for definition see Transforms).

%F Conjecture: a(n)= +2*a(n-6) -a(n-12) . - _R. J. Mathar_, Oct 08 2011

%F Empirical g.f.: (x^11 +5*x^10 +4*x^9 +9*x^8 +3*x^7 +6*x^6 +11*x^5 +7*x^4 +4*x^3 +3*x^2 +x +2) / ((x -1)^2*(x +1)^2*(x^2 -x +1)^2*(x^2 +x +1)^2). - _Colin Barker_, Oct 04 2014

%Y Cf. A000032, A047451, A111958.

%K nonn,easy

%O 0,1

%A _Philippe Deléham_, May 04 2009

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 December 19 20:59 EST 2014. Contains 252239 sequences.