Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108750
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108750 Even numbers n such that there exists a solution to lcm(r+s,t) = n-1, lcm(s,r+t) = n-2, r,s>0, t>1, r+s+t <= n. +0
1
58, 146, 156, 206, 288, 466, 478, 496, 498, 562, 596, 610, 640, 716, 738, 782, 834, 838, 870, 982, 1028, 1068, 1162, 1234, 1276, 1314, 1336, 1366, 1636, 1706, 1718, 1856, 1888, 1982, 2110, 2148, 2186, 2206, 2228, 2416, 2452, 2612, 2626, 2642, 2666, 2668 (list; graph; listen)
OFFSET

1,1

COMMENT

The alternating groups A_n with n even can be generated by a 3-cycle x=(1,2,3) and an (n-1)-cycle y=(2,3,...n) whose product has cycle type 2 x (n-2). These are called standard generators of A_n. If we assume only that o(y)=n-1 and o(xy)=n-2, then for the values of n in the sequence, y could be the product of 2 cycles (cycle type (r+s).t) and xy can have cycle type s.(r+t). Thus the elements of the sequence give those alternating groups A_n which contain pairs of elements which look like standard generators if one only looks at their orders.

EXAMPLE

a(1)=58 because we can take r=11, s=8, t=3 giving lcm(19,3)=57, lcm(8,14)=56

CROSSREFS

Cf. A108157.

Sequence in context: A044309 A044690 A118153 this_sequence A044390 A044771 A127025

Adjacent sequences: A108747 A108748 A108749 this_sequence A108751 A108752 A108753

KEYWORD

nonn

AUTHOR

Simon Nickerson (simonn(AT)maths.bham.ac.uk), Jun 23 2005

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research