Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073360
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073360 Nested floor product of n and fractions (k+1)/k for all k>0 (mod 3), divided by 3. +0
5
1, 4, 9, 20, 29, 44, 69, 104, 121, 180, 241, 284, 349, 420, 521, 664, 701, 860, 1009, 1184, 1301, 1540, 1789, 1964, 2181 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=(1/3)[...[[[[n(2/1)](3/2)](5/4)](6/5)]...(k+1)/k]..., k>0 (mod 3), where [x] = floor of x; this infinite nested floor product will eventually level-off at a(n).

EXAMPLE

a(2) = 4 since (1/3)[[[[[[2(2/1)](3/2)](5/4)](6/5)](8/7)](9/8)](11/10)](12/11)] = (1/3)[[[[[4(3/2)](5/4)](6/5)](8/7)](9/8)](11/10)](12/11)] = (1/3)[[[[6(5/4)](6/5)](8/7)](9/8)](11/10)](12/11)] = (1/3)[[[[7(6/5)](8/7)](9/8)](11/10)](12/11)] = (1/3)[[[[8(8/7)](9/8)](11/10)](12/11)] = (1/3)[[[[9(9/8)](11/10)](12/11)] = (1/3)[[[[10(11/10)](12/11)] = 4

CROSSREFS

Cf. A073359.

Adjacent sequences: A073357 A073358 A073359 this_sequence A073361 A073362 A073363

Sequence in context: A053807 A066109 A030734 this_sequence A075385 A048150 A066186

KEYWORD

easy,nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 29 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 12 13:44 EDT 2008. Contains 144830 sequences.


AT&T Labs Research