Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098135
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098135 a(h) = d(h,j) = lcm( f(h,j,1) ... f(h,j,h) ), when j=3. +0
1
1, 5, 9, 455, 2618, 315, 271700, 56751695, 6930, 3708514810, 32152414840, 135135, 19749267715100, 314645828225300, 34918884, 113543477411038675, 473930651619825400, 669278610, 467655703593591713200 (list; graph; listen)
OFFSET

0,2

FORMULA

Given f(h, j, a) = ( [ ((a/gcd(a, h)) / gcd(j+1, (a/gcd(a, h)))) * (h(j+1)) ] - [ ((a/gcd(a, h)) / gcd(j+1, (a/gcd(a, h)))) * (ja) ]) / a then let a(h) = d(h, j) = lcm( f(h, j, 1) ... f(h, j, h) )

EXAMPLE

a(2) = 5 = lcm(5,1)

a(3) = 9 = lcm(9,3,1)

a(5) = 2618 = lcm(17,7,11,2,1)

a(11) = 32152414840 = (41,19,35,8,29,13,23,5,17,7,1)

CROSSREFS

Cf. A091342, A025558, A097382.

Sequence in context: A097086 A109076 A101683 this_sequence A112259 A099731 A091306

Adjacent sequences: A098132 A098133 A098134 this_sequence A098136 A098137 A098138

KEYWORD

nonn

AUTHOR

Scott C. Macfarlan (scottmacfarlan(AT)covance.com), Sep 27 2004

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 November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research