Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A153263
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A153263
%S A153263 3,5,9,13,23,35,59,93,153,245,399,643,1043,1685,2729,4413,7143,11555,
%T A153263 18699,30253,48953,79205,128159,207363,335523,542885,878409,1421293,
%U A153263 2299703,3720995,6020699,9741693,15762393,25504085,41266479,66770563
%N A153263 A014217(n+3) - A014217(n).
%C A153263 The least significant digits are a sequence of period length 4: 3,5,9,
               3.
%C A153263 One could extend A014217 using its recurrence to define A014217(-1)=-1. 
               This would add a(-1)=3 here by definition, and the least significant 
               digits would still follow the (same, wrapped) period of length 4: 
               3,3,5,9.
%F A153263 a(2n+2)=a(2n+1)+a(2n)+1. a(2n+3)=a(2n+2)+a(2n+1)-1.
%F A153263 a(n)=2*a(n-2)+a(n-3) = (-1)^n+2*A000032(n+1). G.f.: (3+5x+3x^2)/ ((1+x)(1-x-x^2)). 
               [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 07 2009, Apr 
               18 2009]
%Y A153263 Sequence in context: A146905 A052282 A001993 this_sequence A133033 A145365 
               A146433
%Y A153263 Adjacent sequences: A153260 A153261 A153262 this_sequence A153264 A153265 
               A153266
%K A153263 nonn
%O A153263 0,1
%A A153263 Paul Curtz (bpcrtz(AT)free.fr), Dec 22 2008
%E A153263 More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 07 2009
%E A153263 Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 18 2009

    
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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research