Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058232
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058232 a(n)=(a(n-1)a(n-5)+a(n-2)a(n-4)+a(n-3)^2)/a(n-6). +0
1
0, 1, 0, 1, 1, -1, -1, 0, 0, 1, -1, -1, -1, -2, 1, 2, -1, 2, 1, -3, -3, -1, -4, 4, 1, -3, -5, -9, 8, 15, -4, 17, -8, -23, -3, -21, -49, 52, 76, -47, 11, -133, 79, 238, 97, 518, -417, -750, 625, -647, -343, 1967, 3048, -1000, 5553, -8375, -4233, 13375, 10912, 33503 (list; graph; listen)
OFFSET

0,14

REFERENCES

N. D. Elkies (elkies(AT)math.harvard.edu), email, Nov 29, 2000.

LINKS

T. D. Noe, Table of n, a(n) for n=0..300

FORMULA

a(-n)=-a(n). a(n+6)*a(n-6)=a(n+4)*a(n-4)+a(n+2)*a(n-2).

PROGRAM

(PARI) a(n)=local(an, a0, num); if(n<0, -a(-n), if(n==0, 0, a0=[1, 0, 1, 1, -1, -1, 0, 0, 1, -1, -1, -1, -2, 1]; an=vector(n); for(k=1, n, an[k]=if(k<15, a0[k], (num=an[k-1]*an[k-5]+an[k-2]*an[k-4]+an[k-3]^2)/an[k-6])); an[n]))

CROSSREFS

Cf. A006722.

Sequence in context: A053275 A025816 A025813 this_sequence A116933 A088433 A050334

Adjacent sequences: A058229 A058230 A058231 this_sequence A058233 A058234 A058235

KEYWORD

sign,easy,nice

AUTHOR

Michael Somos

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 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research