Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097382
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097382 a(h) = d(h,j) = lcm( f(h,j,1) ... f(h,j,h) ), when j=2. +0
2
1, 4, 35, 20, 3003, 560, 692835, 4620, 185910725, 48048, 136745788725, 1361360, 4281195077775, 22170720, 6541380665835015, 446185740, 1898924328582105825, 5949143200, 90048990529077755175 (list; graph; listen)
OFFSET

1,2

COMMENT

See A091342, A025558

FORMULA

Given (1) 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 (2) a(h) = d(h, j) = lcm( f(h, j, 1) ... f(h, j, h) )

EXAMPLE

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

a(5) = 3003 = lcm(13,11,3,7,1)

a(6) = 560 = lcm(16,7,4,5,8,1)

a(13) = 4281195077775 = lcm(37,35,11,31,29,9,25,23,7,19,17,5,1)

CROSSREFS

Sequence in context: A055621 A000860 A027681 this_sequence A003349 A068968 A011195

Adjacent sequences: A097379 A097380 A097381 this_sequence A097383 A097384 A097385

KEYWORD

nonn

AUTHOR

Scott C Macfarlan (scottmacfarlan(AT)covance.com), Sep 18 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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research