Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076780
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076780 Let u(1)=u(2)=1, u(n)=(2^floor(u(n-1)/2)+1)/u(n-2) then a(n) = denominator of u(n). +0
2
1, 1, 2, 3, 3, 1, 4, 1, 9, 1, 8, 2, 27, 3, 8, 4, 9, 9, 4, 8, 3, 27, 2, 8, 1, 9, 1, 4, 1, 3, 3, 2, 1, 1, 1, 1, 1, 1, 2, 3, 3, 1, 4, 1, 9, 1, 8, 2, 27, 3, 8, 4, 9, 9, 4, 8, 3, 27, 2, 8, 1, 9, 1, 4, 1, 3, 3, 2, 1, 1, 1, 1, 1, 1, 2, 3, 3, 1, 4, 1, 9, 1, 8, 2, 27, 3, 8, 4, 9, 9, 4, 8, 3, 27, 2, 8, 1, 9, 1, 4, 1, 3 (list; graph; listen)
OFFSET

1,3

COMMENT

Sequence is 36-periodic

FORMULA

Period is (1, 1, 2, 3, 3, 1, 4, 1, 9, 1, 8, 2, 27, 3, 8, 4, 9, 9, 4, 8, 3, 27, 2, 8, 1, 9, 1, 4, 1, 3, 3, 2, 1, 1, 1, 1)

CROSSREFS

Cf. A076742.

Adjacent sequences: A076777 A076778 A076779 this_sequence A076781 A076782 A076783

Sequence in context: A087074 A136453 A114104 this_sequence A089283 A077941 A077990

KEYWORD

frac,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 24 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 October 5 16:50 EDT 2008. Contains 144613 sequences.


AT&T Labs Research