Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136373
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136373 a(n) = Prime factors of A128685(n) in order of their first occurence for n>1; a(1) = 1. +0
2
1, 13, 79, 4057, 36037, 222379, 973597, 1310611, 2070433, 4381183, 4905427 (list; graph; listen)
OFFSET

1,2

EXAMPLE

A128685(n) = {1, 13, 1027, 52741, 468481, ...}.

Thus a(1) = 1, a(2) = 13, a(3) = 79, a(4) = 4057, a(5) = 36037.

CROSSREFS

Cf. A128685 = Numbers n such that n^3 divides 12^(n^2)+1. Cf. A127263 = Numbers n such that n^3 divide 2^(n^2)+1. Cf. A136372 = Prime factors of A127263(n) in order of their first occurence. Cf. A128677, A128678, A128679, A128680, A128681, A128682, A128683, A128684.

Adjacent sequences: A136370 A136371 A136372 this_sequence A136374 A136375 A136376

Sequence in context: A032625 A120782 A032652 this_sequence A071614 A045552 A133718

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Dec 27 2007

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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research