login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269360 Permutation of even numbers: a(n) = 1 + A250469(n). 4
2, 4, 6, 10, 8, 16, 12, 22, 26, 28, 14, 34, 18, 40, 36, 46, 20, 52, 24, 58, 56, 64, 30, 70, 50, 76, 66, 82, 32, 88, 38, 94, 86, 100, 78, 106, 42, 112, 96, 118, 44, 124, 48, 130, 116, 136, 54, 142, 122, 148, 126, 154, 60, 160, 92, 166, 146, 172, 62, 178, 68, 184, 156, 190, 120, 196, 72, 202, 176, 208, 74, 214, 80, 220, 186, 226, 144 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..16384

FORMULA

a(n) = 1 + A250469(n).

a(n) = 2 + A253886(n-1).

MATHEMATICA

(* b = A250469 *) b[1] = 1; b[n_] := If[PrimeQ[n], NextPrime[n], m1 = p1 = FactorInteger[n][[1, 1]]; For[ k1 = 1, m1 <= n, m1 += p1; If[m1 == n, Break[]]; If[ FactorInteger[m1][[1, 1]] == p1, k1++]]; m2 = p2 = NextPrime[p1]; For[k2 = 1, True, m2 += p2, If[ FactorInteger[m2][[1, 1]] == p2, k2++]; If[k1+2 == k2, Return[m2]]]];

a[n_] := b[n] + 1;

Array[a, 100] (* Jean-François Alcover, Mar 14 2016 *)

PROG

(Scheme) (define (A269360 n) (+ 1 (A250469 n)))

CROSSREFS

Cf. A253886, A250469, A243501.

Cf. also A269863, A269864.

Sequence in context: A079052 A243502 A275632 * A243501 A076246 A100426

Adjacent sequences:  A269357 A269358 A269359 * A269361 A269362 A269363

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 13 2016

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 22:45 EST 2021. Contains 340359 sequences. (Running on oeis4.)