Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076825
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076825 Let u(1)=1, u(n)=2^u(n-1) (mod n), sequence gives values of n such that u(n)=1. +0
1
3, 15, 21, 51, 65, 95, 165, 255, 261, 273, 285, 295, 345, 387, 465, 507, 513, 565, 641, 837, 1025, 1353, 1665, 1731, 1845, 1953, 1971, 2013, 2123, 2193, 2231, 2325, 2979, 3087, 3237, 3591, 3615, 3645, 3865, 4097, 4369, 4405, 4445, 4655, 4697, 4797, 4995 (list; graph; listen)
OFFSET

1,1

FORMULA

Conjecture: a(n)/n^2 -> infinity

CROSSREFS

Sequence in context: A014493 A147025 A147017 this_sequence A118565 A117801 A087674

Adjacent sequences: A076822 A076823 A076824 this_sequence A076826 A076827 A076828

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 24 2002

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research