Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114977
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114977 Numbers n such that (k^n+n^k) == 0 mod (n+k), k=2 case. +0
1
1, 2, 8, 128, 2144, 4808, 12872, 14168 (list; graph; listen)
OFFSET

1,2
CROSSREFS

Sequence in context: A038533 A030164 A139290 this_sequence A011822 A111179 A058891

Adjacent sequences: A114974 A114975 A114976 this_sequence A114978 A114979 A114980

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Feb 22 2006

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 November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.