login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064554 a(n) = Min {k | A064553(k) = n}. 7
1, 2, 3, 4, 7, 6, 13, 8, 9, 14, 29, 12, 37, 26, 21, 16, 53, 18, 61, 28, 39, 58, 79, 24, 49, 74, 27, 52, 107, 42, 113, 32, 87, 106, 91, 36, 151, 122, 111, 56, 173, 78, 181, 116, 63, 158, 199, 48, 169, 98, 159, 148, 239, 54, 203, 104, 183, 214, 271, 84, 281, 226, 117, 64 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A064553(a(n)) = n and A064553(a(k)) <> k for k < a(n). For prime p, a(p)=prime(p-1), which is sequence A055003. - T. D. Noe, Dec 12 2004
a(n) is not multiplicative because a(7*13) = a(91) = 463, but a(7)*a(13) = 13*37 = 481 and 91 is the smallest possible such n. - Christian G. Bower, May 19 2005
a(n) = A080688(n,1). - Reinhard Zumkeller, Oct 01 2012
Minimal shifted Heinz number of a factorization of n, where the shifted Heinz number of a factorization (y_1, ..., y_k) is prime(y_1 - 1) * ... * prime(y_k - 1). - Gus Wiseman, Sep 05 2018
LINKS
T. D. Noe, Plot of A064554
MATHEMATICA
facs[n_]:=If[n<=1, {{}}, Join@@Table[(Prepend[#1, d]&)/@Select[facs[n/d], Min@@#1>=d&], {d, Rest[Divisors[n]]}]];
Table[Min[Times@@Prime/@(#-1)&/@facs[n]], {n, 100}] (* Gus Wiseman, Sep 05 2018 *)
PROG
(Haskell)
a064554 = head . a080688_row -- Reinhard Zumkeller, Oct 01 2012
CROSSREFS
Cf. A055003 (prime(prime(n)-1)).
Sequence in context: A321220 A036467 A006875 * A290641 A340069 A265352
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Sep 21 2001
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 17 20:28 EDT 2024. Contains 374377 sequences. (Running on oeis4.)