Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126560
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126560 GCD[4(n+1)(n+2),n(n+3)]. +0
1
4, 2, 2, 4, 8, 2, 2, 8, 4, 2, 2, 4, 8, 2, 2, 8, 4, 2, 2, 4, 8, 2, 2, 8, 4, 2, 2, 4, 8, 2, 2, 8, 4, 2, 2, 4, 8, 2, 2, 8, 4, 2, 2, 4, 8, 2, 2, 8 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) = n*(3 + n)/A125650(n). Sequence is periodic with cycle 4,2,2,4,8,2,2,8.

FORMULA

a(n) = GCD[4(n+1)(n+2),n(n+3)]

a(n)=(1/28)*{18*[n mod 8]-17*[(n+1) mod 8]+4*[(n+2) mod 8]+25*[(n+3) mod 8]-10*[(n+4) mod 8]-3*[(n+5) mod 8]+4*[(n+6) mod 8]+11*[(n+7) mod 8]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Jun 01 2007

a(n)=4+(-1+1/2*2^(1/2))*cos(Pi*n/4)-1/2*2^(1/2)*sin(Pi*n/4)+(-1/2*2^(1/2)-1)*cos(3*Pi*n/4)-1/2*2^(1/2)*sin(3*Pi*n/4)+2*cos(n*Pi/2)-2*sin(n*Pi/2) [From Richard Choulet (richardchoulet(AT)yahoo.fr), Dec 11 2008]

MATHEMATICA

Table[GCD[m(3+m), 4(1+m)(2+m)], {m, 48}]

CROSSREFS

Cf. A125650.

Sequence in context: A141035 A100854 A021707 this_sequence A064213 A016510 A023634

Adjacent sequences: A126557 A126558 A126559 this_sequence A126561 A126562 A126563

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Mar 12 2007

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 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research