Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025579
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A025579
%S A025579 1,2,4,12,36,108,324,972,2916,8748,26244,78732,236196,708588,2125764,
%T A025579 6377292,19131876,57395628,172186884,516560652,1549681956,4649045868,
%U A025579 13947137604,41841412812,125524238436,376572715308,1129718145924
%N A025579 a(1)=1, a(2)=2, a(n) = 4*3^(n-3) for n >= 3.
%C A025579 a(n) = sum of the numbers in row n+1 of the array defined in A025564 
               (and of the array in A024996).
%C A025579 a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, 
               s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for 
               i >= 3.
%F A025579 a(n)=A003946(n-2), n>2. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               May 28 2008
%Y A025579 Sequence in context: A149838 A149839 A149840 this_sequence A010552 A149841 
               A149842
%Y A025579 Adjacent sequences: A025576 A025577 A025578 this_sequence A025580 A025581 
               A025582
%K A025579 nonn,nice
%O A025579 1,2
%A A025579 Clark Kimberling (ck6(AT)evansville.edu)
%E A025579 Definition corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               May 28 2008

    
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 December 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research