Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A028860
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A028860 a(n+2) = 2 a(n+1) + 2 a(n). +0
7
-1, 1, 0, 2, 4, 12, 32, 88, 240, 656, 1792, 4896, 13376, 36544, 99840, 272768, 745216, 2035968, 5562368, 15196672, 41518080, 113429504, 309895168, 846649344, 2313089024, 6319476736, 17265131520 (list; graph; listen)
OFFSET

0,4

LINKS

Tanya Khovanova, Recursive Sequences

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 924

FORMULA

a(n) = 4*A028859(n-4), for n>3.

CROSSREFS

Adjacent sequences: A028857 A028858 A028859 this_sequence A028861 A028862 A028863

Sequence in context: A079472 A006948 A109388 this_sequence A106433 A026151 A025178

KEYWORD

sign

AUTHOR

njas

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 May 22 15:55 EDT 2008. Contains 140006 sequences.


AT&T Labs Research