login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108514 Let p = smallest odd prime divisor of n; then a(n) = (p-1)*n/p. 3
1, 2, 2, 4, 4, 4, 6, 8, 6, 8, 10, 8, 12, 12, 10, 16, 16, 12, 18, 16, 14, 20, 22, 16, 20, 24, 18, 24, 28, 20, 30, 32, 22, 32, 28, 24, 36, 36, 26, 32, 40, 28, 42, 40, 30, 44, 46, 32, 42, 40, 34, 48, 52, 36, 44, 48, 38, 56, 58, 40, 60, 60, 42, 64, 52, 44, 66, 64, 46, 56, 70, 48, 72, 72, 50 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

Z. Nedev, A Reduced Computational Complexity Strategy for the Magnus-Derek Game, International Mathematical Forum, Vol. 9, 2014, no. 7, pp. 325 - 333; http://dx.doi.org/10.12988/imf.2014.411. See p. 326. - N. J. A. Sloane, Jun 12 2014

Z. Nedev and S. Muthukrishnan, The Nagger-Mover Game, DIMACS Tech. Report 2005-22.

LINKS

Table of n, a(n) for n=1..75.

MAPLE

with(numtheory): a:=proc(n) local nn: nn:=factorset(n): if n=1 then 1 elif nn={2} then n elif nn[1]=2 then (nn[2]-1)*n/nn[2] else (nn[1]-1)*n/nn[1] fi end:

CROSSREFS

Cf. A108738.

Sequence in context: A035114 A202103 A062570 * A120456 A115383 A219156

Adjacent sequences:  A108511 A108512 A108513 * A108515 A108516 A108517

KEYWORD

nonn

AUTHOR

S. Muthukrishnan (muthu(AT)research.att.com), Jun 23 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 25 17:54 EST 2014. Contains 250000 sequences.