Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051138
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051138 Associated with division polynomial of y^2+y=x^3-x and point (0,0). +0
1
0, 1, 1, -1, -5, -4, 29, 129, -65, -3689, -16264, 113689, 2382785, 7001471, -398035821, -7911171596, 43244638645, 6480598259201, 124106986093951, -5987117709349201, -541051130050800400, -4830209396684261199 (list; graph; listen)
OFFSET

0,5

REFERENCES

C. Kimberling, Strong divisibility sequences and some conjectures, Fib. Quart., 17 (1979), 13-17.

LINKS

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

FORMULA

a(n)=(a(n-1)a(n-3)+a(n-2)^2)/a(n-4), a(n)=(-a(n-1)a(n-4)+5a(n-2)a(n-3))/a(n-5), a(2n+1)=a(n+2)a(n)^3 - a(n-1)a(n+1)^3, a(2n)=a(n+2)a(n)a(n-1)^2 - a(n)a(n-2)a(n+1)^2.

PROGRAM

(PARI) an=vector(200); an=concat([ 1, 1, -1, -5 ], an); for(n=5, length(an), an[ n ]=(an[ n-1 ]*an[ n-3 ]+an[ n-2 ]^2)/an[ n-4 ]); a(n)=an[ n ]

CROSSREFS

A006769(2n)=a(n), A028937(n)=a(n)^2, A028939(n)=|a(n)|^3. Cf. A006769, A006720, A028937, A028939.

Adjacent sequences: A051135 A051136 A051137 this_sequence A051139 A051140 A051141

Sequence in context: A057423 A038246 A024067 this_sequence A091001 A078811 A093399

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 October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research