Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,7

COMMENT

Sequence is 24-periodic

FORMULA

Period is (1, 1, 1, 1, 1, 1, 3, 4, 1, 13, 13, 1, 3, 12, 3, 1, 13, 13, 1, 4, 3, 1, 1, 1)

CROSSREFS

Cf. A076784.

Sequence in context: A154602 A109956 A123319 this_sequence A110506 A114189 A059110

Adjacent sequences: A076782 A076783 A076784 this_sequence A076786 A076787 A076788

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research