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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056867 Nilpotent numbers: n such that every group of order n is nilpotent. 4
1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 15, 16, 17, 19, 23, 25, 27, 29, 31, 32, 33, 35, 37, 41, 43, 45, 47, 49, 51, 53, 59, 61, 64, 65, 67, 69, 71, 73, 77, 79, 81, 83, 85, 87, 89, 91, 95, 97, 99, 101, 103, 107, 109, 113, 115, 119, 121, 123, 125, 127, 128, 131, 133, 135, 137, 139 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

J. Pakianathan and K. Shankar, Nilpotent Numbers, Amer. Math. Monthly, 107, August-September 2000, 631-634.

PROG

(PARI) is(n)=my(f=factor(n), k=#f[, 1]); for(i=1, k, for(j=1, k, if(i!=j&&f[i, 1]^f[i, 2]%f[j, 1]==1, return(0)))); 1 \\ Charles R Greathouse IV, Nov 26 2011

CROSSREFS

Cf. A003277, A051532, A056866. Complement of A056868.

Sequence in context: A174894 A088948 A115405 * A062491 A087092 A046684

Adjacent sequences:  A056864 A056865 A056866 * A056868 A056869 A056870

KEYWORD

nonn,nice,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Sep 02 2000

EXTENSIONS

More terms from Francisco Salinas (franciscodesalinas(AT)hotmail.com), Dec 25 2001

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 February 16 09:00 EST 2012. Contains 205904 sequences.