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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170826 a(n) = GCD(n^2, n!). 4
1, 2, 3, 8, 5, 36, 7, 64, 81, 100, 11, 144, 13, 196, 225, 256, 17, 324, 19, 400, 441, 484, 23, 576, 625, 676, 729, 784, 29, 900, 31, 1024, 1089, 1156, 1225, 1296, 37, 1444, 1521, 1600, 41, 1764, 43, 1936, 2025, 2116, 47, 2304, 2401, 2500, 2601, 2704, 53, 2916 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

If n is prime then a(n)=n else if n<>4 then a(n)=n^2. - Zak Seidov, Dec 28 2009

MAPLE

GCDWITHFACTORIAL:=proc(a) local b, i, k:

if whattype(a) <> list then RETURN([]); fi:

b:=[]:

for i to nops(a) do b:=[op(b), gcd(a[i], i!)]: od;

RETURN(b);

end:

PROG

(PARI) a(n)=if(isprime(n), n, if(n==4, 8, n^2)) \\ Charles R Greathouse IV, Feb 01 2013

CROSSREFS

Sequence in context: A190997 A184392 A007955 * A162537 A109844 A128779

Adjacent sequences:  A170823 A170824 A170825 * A170827 A170828 A170829

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Dec 27 2009

STATUS

approved

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

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

Last modified May 18 06:08 EDT 2013. Contains 225419 sequences.