Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135354
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135354 a(0)=1. a(n) = largest divisor of n! that is coprime to a(n-1). +0
1
1, 1, 2, 3, 8, 15, 16, 315, 128, 2835, 256, 155925, 1024, 6081075, 2048, 638512875, 32768, 10854718875, 65536, 1856156927625, 262144, 194896477400625, 524288, 49308808782358125, 4194304 (list; graph; listen)
OFFSET

0,3

FORMULA

a(2n) = the largest power of 2 that divides (2n)!. a(2n+1) = the largest odd divisor of (2n+1)! = (2n+1)!/a(2n).

MATHEMATICA

a = {1}; For[n = 1, n < 25, n++, AppendTo[a, Select[Divisors[n! ], GCD[a[[ -1]], # ] == 1 &][[ -1]]]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 10 2007

CROSSREFS

Cf. A060818, A049606.

Adjacent sequences: A135351 A135352 A135353 this_sequence A135355 A135356 A135357

Sequence in context: A007919 A069752 A004731 this_sequence A122412 A128035 A003473

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Dec 07 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 10 2007

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 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research