Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111352
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111352 a(n+3) = a(n+2) + 3*a(n+1) + a(n). +0
1
1, -1, 2, 0, 5, 7, 22, 48, 121, 287, 698, 1680, 4061, 9799, 23662, 57120, 137905, 332927, 803762, 1940448, 4684661, 11309767, 27304198, 65918160, 159140521, 384199199, 927538922, 2239277040, 5406093005 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) + a(n+1) = A000129(n); a(n+2) - a(n) = A001333(n)

REFERENCES

C. Dement, Floretion-generated Integer Sequences (work in progress)

FORMULA

a(n) = (1/4*sqrt(2)-1/4)*(1+sqrt(2))^n + (-1/4*sqrt(2)-1/4)*(1-sqrt(2))^n + 3/2*(-1)^n; G.f. (2*x-1)/((x+1)*(x^2+2*x-1))

PROGRAM

Floretion Algebra Multiplication Program, FAMP Code: 2jbasekrokseq[A*H] with A = + .25'i + .25i' + .25'ii' + .25'jj' + .25'kk' + .25'jk' + .25'kj' + .25e; H = - 2'i - 'j + 'k; roktype : Y[15] = Y[15] + (-1)^p (internal program code)

CROSSREFS

Cf. A000129, A001333.

Sequence in context: A078049 A021490 A084258 this_sequence A133446 A011122 A085009

Adjacent sequences: A111349 A111350 A111351 this_sequence A111353 A111354 A111355

KEYWORD

easy,sign

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Oct 29 2005

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research