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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015943 (2^(2n)+n) mod (2n). 1
1, 2, 1, 4, 9, 10, 11, 8, 1, 6, 15, 4, 17, 2, 19, 16, 21, 10, 23, 36, 1, 38, 27, 40, 49, 42, 1, 4, 33, 46, 35, 32, 31, 50, 9, 28, 41, 54, 25, 56, 45, 22, 47, 36, 19, 62, 51, 16, 67, 26, 13, 100, 57, 82, 89, 72, 7, 74, 63, 76, 65, 78, 1, 64, 49, 70, 71, 52, 133, 46, 75 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

MATHEMATICA

Table[Mod[PowerMod[2, 2*n, 2*n] + n, 2*n], {n, 100}] (* T. D. Noe, Aug 04 2011 *)

CROSSREFS

Sequence in context: A262066 A057046 A163547 * A006445 A174255 A254199

Adjacent sequences:  A015940 A015941 A015942 * A015944 A015945 A015946

KEYWORD

nonn

AUTHOR

Robert G. Wilson v

EXTENSIONS

Definition clarified by R. J. Mathar, Aug 04 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 28 07:57 EDT 2017. Contains 287212 sequences.