Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078117
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078117 Let u(1)=n, u(2)=n+1, v(1)=n+2, v(2)=n+3, u(k)=abs(u(k-1)-v(k-2)), v(k)=abs(v(k-1)-u(k-2)), then a(n) is the smallest integer such that for any k>=a(n), v(k)=u(k). +0
1
8, 11, 15, 17, 15, 11, 12, 14, 12, 14, 9, 14, 12, 17, 21, 23, 21, 16, 18, 20, 18, 20, 15, 20, 18, 23, 27, 29, 27, 22, 24, 26, 24, 26, 21, 26, 24, 29, 33, 35, 33, 28, 30, 32, 30, 32, 27, 32, 30, 35, 39, 41, 39, 34, 36, 38, 36, 38, 33, 38, 36, 41, 45, 47, 45, 40, 42, 44, 39, 44 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)/n -> 1/2; for n>= 7, a(n) = (1/2)*(n+b(n)) where b(n) is the 12-periodic sequence (17, 20, 15, 18, 7, 16, 11, 20, 27, 30, 25, 14)

CROSSREFS

Sequence in context: A101573 A029629 A028394 this_sequence A032423 A063724 A167499

Adjacent sequences: A078114 A078115 A078116 this_sequence A078118 A078119 A078120

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 05 2002

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research