Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A052466
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A052466
a(n) is the solution k to Mod[24k,13^n]==1.
+0
4
6, 162, 1007, 27371, 170176, 4625692, 28759737, 781741941, 4860395546, 132114388022, 821406847267, 22327331575711, 138817757188116, 3773319036295152, 23460200964791597, 637690917133880681
(
list
;
graph
;
listen
)
page 1
Search completed in 0.001 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 25 20:09 EST 2009. Contains 167514 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
