A007395 -id:A007395 - cp's OEIS frontend

A270028 a(n) is the smallest b >= 3 for which the base-b representation of n contains at least one 1 (or 0 if no such base exists).

3, 0, 3, 3, 3, 4, 3, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 5, 3, 3, 3, 6, 3, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 3, 3, 4, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3

Offset: 1

Nathan Fox, Mar 08 2016

If we drop the b >= 3 requirement, then this sequence becomes A007395 (the constant 2 sequence).
a(n) > 0 for n >= 3 since the base-(n-1) representation of n is 11.
a(n)=3 if and only if n is in A081606.
The only perfect k-th powers (k >= 2) that can appear in this sequence are 2^k with k a prime number.
The first n for which a(n)=7 is 560.
The first n for which a(n)=8 is 870899850.
The first n for which a(n)=10 is 871017138.
The first n for which a(n)=11 is 65473886952.
The first n for which a(n)=12 is 65473886954.

Nathan Fox, Table of n, a(n) for n = 1..10000

Cf. A270027, A216194, A270029, A270030, A270031, A270033, A270034, A270035, A270038.

Table[SelectFirst[Range[3, 10], DigitCount[n, #, 1] > 0 &], {n, 3, 120}] (* Michael De Vlieger, Mar 10 2016, Version 10 *)

a(n) = if (n==2, 0, my(b=3); while(!vecsearch(Set(digits(n, b)), 1), b++); b); \\ Michel Marcus, Mar 10 2016

A341533 Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = sqrt( Product_{a=1..n} Product_{b=1..k} (4sin((2a-1)Pi/(2n))^2 + 4sin((2b-1)*Pi/k)^2) ).

Original entry on oeis.org

2, 8, 2, 14, 36, 2, 36, 50, 200, 2, 82, 256, 224, 1156, 2, 200, 722, 2916, 1058, 6728, 2, 478, 2916, 9922, 38416, 5054, 39204, 2, 1156, 10082, 80000, 155682, 527076, 24200, 228488, 2, 2786, 38416, 401998, 2775556, 2540032, 7311616, 115934, 1331716, 2

Offset: 1

Seiichi Manyama, Feb 13 2021

			Square array begins:
  2,     8,    14,      36,       82,        200, ...
  2,    36,    50,     256,      722,       2916, ...
  2,   200,   224,    2916,     9922,      80000, ...
  2,  1156,  1058,   38416,   155682,    2775556, ...
  2,  6728,  5054,  527076,  2540032,  105125000, ...
  2, 39204, 24200, 7311616, 41934482, 4115479104, ...

Columns 1..7 give A007395, A341543, A231087, A341544, A231485, A341545, A230033.
Main diagonal gives A341535.
Cf. A340475.

default(realprecision, 120);
T(n, k) = round(sqrt(prod(a=1, n, prod(b=1, k, 4*sin((2*a-1)*Pi/(2*n))^2+4*sin((2*b-1)*Pi/k)^2))));

A353526 The smallest prime not dividing n, reduced modulo 4.

Original entry on oeis.org

2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2

Offset: 1

Antti Karttunen, Apr 24 2022

nonn

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

Cf. A010873, A053669, A353486, A353516, A353528, A353529.

Cf. A007395, A353527 (bisections).

a[n_] := Module[{p = 2}, While[Divisible[n, p], p = NextPrime[p]]; Mod[p, 4]]; Array[a, 100] (* Amiram Eldar, Jul 25 2022 *)

A053669(n) = forprime(p=2, , if(n%p, return(p))); \\ From A053669
A353526(n) = (A053669(n)%4);

a(n) = A010873(A053669(n)).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{p prime} ((p mod 4)*(p-1)/(Product_{q prime, q <= p} q)) = 2.2324714414... . - Amiram Eldar, Jul 25 2022

A036453 a(n) = d(d(d(d(d(n))))), the 5th iterate of the number-of-divisors function d = A000005, with initial value n.

Original entry on oeis.org

1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2

Offset: 1

Labos Elemer

nonn

The iterated d function rapidly converges to fixed point 2. In the 5th iterated d-sequence, the first term different from the fixed point 2 appears at n = 5040. The 6th and further iterated sequences have very long initial segment of 2's. In the 6th one the first non-stationary term is a(293318625600) = 3. In such sequences any large value occurs infinite many times and constructible.

Differs from A007395 for n = 1, 5040, 7920, 8400, 9360, 10080, 10800, etc. - R. J. Mathar, Oct 20 2008

			E.g., n = 96 and its successive iterates are 12, 6, 4, 3 and 2. The 5th term is a(96) = 2 is stationary (fixed).

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A000005, A010553, A036450, A036452.

Table[Nest[DivisorSigma[0,#]&,n,5],{n,110}] (* Harvey P. Dale, Jun 18 2021 *)

a(n)=my(d=numdiv);d(d(d(d(d(n))))) \\ Charles R Greathouse IV, Apr 07 2012

Previous Mathematica program replaced by Harvey P. Dale, Jun 18 2021

A212012 Triangle read by rows in which row n lists the number of states of the subshells of the n-th shell of the nuclear shell model ordered by energy level in increasing order.

Original entry on oeis.org

2, 4, 2, 6, 4, 2, 8, 6, 4, 2, 10, 8, 6, 4, 2, 12, 10, 8, 6, 4, 2, 14, 12, 10, 8, 6, 4, 2, 16, 14, 12, 10, 8, 6, 4, 2, 18, 16, 14, 12, 10, 8, 6, 4, 2, 20, 18, 16, 14, 12, 10, 8, 6, 4, 2, 22, 20, 18, 16, 14, 12, 10, 8, 6, 4, 2, 24, 22, 20, 18, 16, 14, 12, 10, 8, 6, 4, 2

Offset: 1

Omar E. Pol, Jul 15 2012

Also triangle read by rows in which row i lists the first i positive even numbers in decreasing order.

The list of the spin-orbit coupling of this version of the nuclear shell model starts: 1s_(1/2), 1p_(3/2), 1p_(1/2), 1d_(5/2), 1d_(3/2), etc. (see link section). The numerators of the fractions are 1, 3, 1, 5, 3,... then we add 1 to every numerator, so we have this sequence: 2, 4, 2, 6, 4,... Other sequences that arise from this sequence are both A212013 and A212014. - Omar E. Pol, Sep 02 2012

			Illustration of initial terms: one of the views of a three-dimensional shell model of nucleus.
.
.|-------------------------- j --------------------------|
.|                                                       |
.|   |---------------------- i ----------------------|   |
.|   |                                               |   |
.|   |   |------------------ h ------------------|   |   |
.|   |   |                                       |   |   |
.|   |   |   |-------------- g --------------|   |   |   |
.|   |   |   |                               |   |   |   |
.|   |   |   |   |---------- f ----------|   |   |   |   |
.|   |   |   |   |                       |   |   |   |   |
.|   |   |   |   |   |------ d ------|   |   |   |   |   |
.|   |   |   |   |   |               |   |   |   |   |   |
.|   |   |   |   |   |   |-- p --|   |   |   |   |   |   |
.|   |   |   |   |   |   |       |   |   |   |   |   |   |
.|   |   |   |   |   |   |   s   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   2   |   |   |   |   |   |   |
.|   |   |   |   |   |   4   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   2   |   |   |   |   |   |
.|   |   |   |   |   6   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   4   |   |   |   |   |
.|   |   |   |   |   |   |   2   |   |   |   |   |   |   |
.|   |   |   |   8   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   6   |   |   |   |
.|   |   |   |   |   |   4   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   2   |   |   |   |   |   |
.|   |   |  10   |   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   |   8   |   |   |
.|   |   |   |   |   6   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   4   |   |   |   |   |
.|   |   |   |   |   |   |   2   |   |   |   |   |   |   |
.|   |  12   |   |   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   |   |  10   |   |
.|   |   |   |   8   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   6   |   |   |   |
.|   |   |   |   |   |   4   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   2   |   |   |   |   |   |
.|  14   |   |   |   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   |   |   |  12   |
.|   |   |  10   |   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   |   8   |   |   |
.|   |   |   |   |   6   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   4   |   |   |   |   |
.|   |   |   |   |   |   |   2   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |   |   |   |   |   |   |   |
.|   |   |   |   |   |   |   |1/2|   |   |   |   |   |   |
.|   |   |   |   |   |   |           |   |   |   |   |   |
.|   |   |   |   |   |   |----3/2----|   |   |   |   |   |
.|   |   |   |   |   |                   |   |   |   |   |
.|   |   |   |   |   |--------5/2--------|   |   |   |   |
.|   |   |   |   |                           |   |   |   |
.|   |   |   |   |------------7/2------------|   |   |   |
.|   |   |   |                                   |   |   |
.|   |   |   |----------------9/2----------------|   |   |
.|   |   |                                           |   |
.|   |   |-------------------11/2--------------------|   |
.|   |                                                   |
.|   |-----------------------13/2------------------------|
.|
.|---------------------------15/2-------------------------
.
For another view of the model see the example section of A212122, second part.
Example 1. Triangle begins:
  2;
  4,   2;
  6,   4,  2;
  8,   6,  4,  2;
  10,  8,  6,  4,  2;
  12, 10,  8,  6,  4,  2;
  14, 12, 10,  8,  6,  4, 2;
  16, 14, 12, 10,  8,  6, 4, 2;
...
Column 1 gives positive terms of A005843. Right border give positive terms of A007395. Row sums give A002378.
Example 2. Written as an irregular triangle in which row j represents the j-th shell of nucleus. Note that row 4 has only one term. Triangle begins:
  2;
  4,   2;
  6,   4,  2;
  8;
  6,   4,  2, 10;
  8,   6,  4,  2, 12;
  10,  8,  6,  4,  2, 14;
  12, 10,  8,  6,  4,  2, 16;
  14, 12, 10,  8,  6,  4,  2, 18;

Paolo Xausa, Table of n, a(n) for n = 1..11325 (rows 1..150 of triangle, flattened).
M. Goeppert Mayer, Nuclear configurations in the spin-orbit coupling model. I. Empirical evidence, Phys. Rev. 78, 16-21 (1950).
M. Goeppert Mayer, Nuclear configurations in the spin-orbit coupling model. II. Theoretical considerations, Phys. Rev. 78: 22 (1950).

Partial sums give A212014. Other versions are A162630, A212122, A213362, A213372.

Cf. A002378, A004736, A005843, A007395, A212013, A212014.

2*Range[Range[15], 1, -1] (* Paolo Xausa, Mar 14 2025 *)

a(n) = 2*A004736(n).

A216620 Square array read by antidiagonals: T(n,k) = Sum_{c|n,d|k} phi(gcd(c,d)) for n>=1, k>=1.

Original entry on oeis.org

1, 2, 2, 2, 4, 2, 3, 4, 4, 3, 2, 6, 5, 6, 2, 4, 4, 6, 6, 4, 4, 2, 8, 4, 10, 4, 8, 2, 4, 4, 10, 6, 6, 10, 4, 4, 3, 8, 4, 12, 7, 12, 4, 8, 3, 4, 6, 8, 6, 8, 8, 6, 8, 6, 4, 2, 8, 8, 14, 4, 20, 4, 14, 8, 8, 2, 6, 4, 8, 9, 8, 8, 8, 8, 9, 8, 4, 6, 2, 12, 4, 12, 6

Offset: 1

Peter Luschny, Sep 12 2012

T(n,n) = A060648(n) = Sum_{d|n} Dedekind_Psi(d).
T(n,1) = T(1,n) = A000005(n) = tau(n).
T(n,2) = T(2,n) = A062011(n) = 2*tau(n).
T(n+1,n) = A092517(n) = tau(n+1)*tau(n).
T(prime(n),1) = A007395(n) = 2.
T(prime(n),prime(n)) = A052147(n) = prime(n)+2.

			[----1---2---3---4---5---6---7---8---9--10--11--12]
[ 1] 1,  2,  2,  3,  2,  4,  2,  4,  3,  4,  2,  6
[ 2] 2,  4,  4,  6,  4,  8,  4,  8,  6,  8,  4, 12
[ 3] 2,  4,  5,  6,  4, 10,  4,  8,  8,  8,  4, 15
[ 4] 3,  6,  6, 10,  6, 12,  6, 14,  9, 12,  6, 20
[ 5] 2,  4,  4,  6,  7,  8,  4,  8,  6, 14,  4, 12
[ 6] 4,  8, 10, 12,  8, 20,  8, 16, 16, 16,  8, 30
[ 7] 2,  4,  4,  6,  4,  8,  9,  8,  6,  8,  4, 12
[ 8] 4,  8,  8, 14,  8, 16,  8, 22, 12, 16,  8, 28
[ 9] 3,  6,  8,  9,  6, 16,  6, 12, 17, 12,  6, 24
[10] 4,  8,  8, 12, 14, 16,  8, 16, 12, 28,  8, 24
[11] 2,  4,  4,  6,  4,  8,  4,  8,  6,  8, 13, 12
[12] 6, 12, 15, 20, 12, 30, 12, 28, 24, 24, 12, 50
.
Displayed as a triangular array:
   1,
   2, 2,
   2, 4,  2,
   3, 4,  4,  3,
   2, 6,  5,  6, 2,
   4, 4,  6,  6, 4,  4,
   2, 8,  4, 10, 4,  8, 2,
   4, 4, 10,  6, 6, 10, 4, 4,
   3, 8,  4, 12, 7, 12, 4, 8, 3,

Alois P. Heinz, Antidiagonals n = 1..141, flattened

Cf. A216621, A216622, A216623, A216624, A216625, A216626, A216627.

with(numtheory):
T:= (n, k)-> add(add(phi(igcd(c,d)), c=divisors(n)), d=divisors(k)):
seq(seq(T(n, 1+d-n), n=1..d), d=1..14);  # Alois P. Heinz, Sep 12 2012

t[n_, k_] := Outer[ EulerPhi[ GCD[#1, #2]]&, Divisors[n], Divisors[k]] // Flatten // Total; Table[ t[n-k+1, k], {n, 1, 13}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jun 26 2013 *)

def A216620(n, k) :
    cp = cartesian_product([divisors(n), divisors(k)])
    return reduce(lambda x,y: x+y, map(euler_phi, map(gcd, cp)))
for n in (1..12): [A216620(n,k) for k in (1..12)]

A065167 Table T(n,k) read by antidiagonals, where the k-th row gives the permutation t->t+k of Z, folded to N (k >= 0, n >= 1).

Original entry on oeis.org

1, 2, 2, 3, 4, 4, 4, 1, 6, 6, 5, 6, 2, 8, 8, 6, 3, 8, 4, 10, 10, 7, 8, 1, 10, 6, 12, 12, 8, 5, 10, 2, 12, 8, 14, 14, 9, 10, 3, 12, 4, 14, 10, 16, 16, 10, 7, 12, 1, 14, 6, 16, 12, 18, 18, 11, 12, 5, 14, 2, 16, 8, 18, 14, 20, 20, 12, 9, 14, 3, 16, 4, 18, 10, 20, 16, 22, 22, 13, 14, 7, 16, 1

Offset: 0

Antti Karttunen, Oct 19 2001

Simple periodic site swap permutations of natural numbers.

Row n of the table (starting from n=0) gives a permutation of natural numbers corresponding to the simple, infinite, periodic site swap pattern ...nnnnn...

			Table begins:
1 2 3 4 5 6 7 ...
2 4 1 6 3 8 5 ...
4 6 2 8 1 10 3 ...
6 8 4 10 2 12 1 ...

Joe Buhler and R. L. Graham, Juggling Drops and Descents, Amer. Math. Monthly, 101, (no. 6) 1994, 507 - 519.
Juggling Information Service, Site Swap FAQs

Successive rows and associated site swap sequences, starting from the zeroth row: (A000027, A000004), (A065164, A000012), (A065165, A007395), (A065166, A010701). Cf. also A065171, A065174, A065177. trinv given at A054425.

PerSS_table := (n) -> PerSS((((trinv(n)-1)*(((1/2)*trinv(n))+1))-n)+1, (n-((trinv(n)*(trinv(n)-1))/2))); PerSS := (n,c) -> Z2N(N2Z(n)+c);
N2Z := n -> ((-1)^n)*floor(n/2); Z2N := z -> 2*abs(z)+`if`((z < 1),1,0);
[seq(PerSS_table(j),j=0..119)];

Let f: Z -> N be given by f(z) = 2z if z>0 else 2|z|+1, with inverse g(z) = z/2 if z even else (1-z)/2. Then the n-th term of the k-th row is f(g(n)+k).

A075117 Table by antidiagonals of generalized Lucas numbers: T(n,k) = T(n,k-1) + n*T(n,k-2) with T(n,0)=2 and T(n,1)=1.

Original entry on oeis.org

2, 1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 4, 5, 1, 2, 1, 7, 7, 7, 1, 2, 1, 11, 17, 10, 9, 1, 2, 1, 18, 31, 31, 13, 11, 1, 2, 1, 29, 65, 61, 49, 16, 13, 1, 2, 1, 47, 127, 154, 101, 71, 19, 15, 1, 2, 1, 76, 257, 337, 297, 151, 97, 22, 17, 1, 2, 1, 123, 511, 799, 701, 506, 211, 127, 25, 19, 1, 2

Offset: 0

Henry Bottomley, Sep 02 2002

			Array starts as:
  2, 1,  1,  1,  1,   1, ...;
  2, 1,  3,  4,  7,  11, ...;
  2, 1,  5,  7, 17,  31, ...;
  2, 1,  7, 10, 31,  61, ...;
  2, 1,  9, 13, 49, 101, ...;
  2, 1, 11, 16, 71, 151, ...; etc.

G. C. Greubel, Antidiagonals n = 0..100, flattened

Cf. A060959.
Rows include: A054977, A000032, A014551, A075118, A072265.
Columns include: A007395, A000012, A005408, A016777, A056220, A062786.

[2^(1+k-n)*(&+[Binomial(n-k,2*j)*(1+4*k)^j: j in [0..Floor((n-k)/2)]]): k in [0..n], n in [0..13]]; // G. C. Greubel, Jan 27 2020

seq(seq( 2^(1+k-n)*add( binomial(n-k, 2*j)*(1+4*k)^j, j=0..floor((n-k)/2)), k=0..n), n=0..13); # G. C. Greubel, Jan 27 2020

T[n_, k_]:= ((1 + Sqrt[1+4n])/2)^k + ((1 - Sqrt[1+4n])/2)^k; Table[If[n==0 && k==0, 2, T[k, n-k]]//Simplify, {n,0,13}, {k,0,n}]//Flatten (* G. C. Greubel, Jan 27 2020 *)

def T(n, k): return 2^(1-k)*sum( binomial(k, 2*j)*(1+4*n)^j for j in (0..floor(k/2)) )
[[T(k,n-k) for k in (0..n)] for n in (0..13)] # G. C. Greubel, Jan 27 2020

T(n, k) = ((1+sqrt(4*n+1))/2)^k + ((1-sqrt(4*n+1))/2)^k = 2*A060959(n, k+1) - A060959(n, k).

T(n, k) = 2^(1-k)*Sum_{j=0..floor(k/2)} binomial(k, 2*j)*(1+4*n)^j. - G. C. Greubel, Jan 27 2020

A185633 For odd n, a(n) = 2; for even n, a(n) = denominator of Bernoulli(n)/n; The number 2 alternating with the elements of A006953.

Original entry on oeis.org

2, 12, 2, 120, 2, 252, 2, 240, 2, 132, 2, 32760, 2, 12, 2, 8160, 2, 14364, 2, 6600, 2, 276, 2, 65520, 2, 12, 2, 3480, 2, 85932, 2, 16320, 2, 12, 2, 69090840, 2, 12, 2, 541200, 2, 75852, 2, 2760, 2, 564, 2, 2227680, 2, 132, 2, 6360

Offset: 1

Paul Curtz, Dec 18 2012

nonn

There is an integer sequence b(n) = A053657(n)/2^(n-1) = 1, 1, 6, 6, 360, 360, 45360, 45360, 5443200, 5443200,... which consists of the duplicated entries of A202367.

The ratios of this sequence are b(n+1)/b(n) = 1, 6, 1, 60, 1, 126 .... = a(n)/2, which is a variant of A036283.

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

Cf. A006953, A007395 (bisections).

Cf. A006863, A027760, A067513, A322312, A322315 (rgs-transform).

A185633 := proc(n)
    A053657(n+1)/A053657(n) ;
end proc: # R. J. Mathar, Dec 19 2012

max = 52; s = Expand[Normal[Series[(-Log[1-x]/x)^z, {x, 0, max}]]]; a[n_, k_] := Denominator[Coefficient[s, x^n*z^k]]; A053657 = Prepend[LCM @@@ Table[a[n, k], {n, max}, {k, n}], 1]; a[n_] := A053657[[n+1]]/A053657[[n]]; Table[a[n], {n, 1, max}] (* Jean-François Alcover, Dec 20 2012 *)

A185633(n) = if(n%2,2,denominator(bernfrac(n)/(n))); \\ Antti Karttunen, Dec 03 2018

A185633(n) = { my(m=1); fordiv(n, d, if(isprime(1+d), m *= (1+d)^(1+valuation(n,1+d)))); (m); }; \\ Antti Karttunen, Dec 03 2018

a(n) = A053657(n+1)/A053657(n).
a(2*n) = 2*A036283(n).
From Antti Karttunen, Dec 03 2018: (Start)
a(n) = Product_{d|n} [(1+d)^(1+A286561(n,1+d))]^A010051(1+d) - after Peter J. Cameron's Mar 25 2002 comment in A006863.
A007947(a(n)) = A027760(n)
A001221(a(n)) = A067513(n).
A181819(a(n)) = A322312(n).
(End)

Name edited by Antti Karttunen, Dec 03 2018

A268833 Square array A(n, k) = A101080(k, A003188(n+A006068(k))), read by descending antidiagonals, where A003188 is the binary Gray code, A006068 is its inverse, and A101080(x,y) gives the Hamming distance between binary expansions of x and y.

Original entry on oeis.org

0, 0, 1, 0, 1, 2, 0, 1, 2, 1, 0, 1, 2, 3, 2, 0, 1, 2, 3, 2, 3, 0, 1, 2, 1, 2, 1, 2, 0, 1, 2, 3, 2, 3, 2, 1, 0, 1, 2, 1, 2, 3, 4, 3, 2, 0, 1, 2, 1, 2, 3, 4, 3, 2, 3, 0, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 0, 1, 2, 3, 2, 3, 4, 3, 2, 1, 4, 3, 0, 1, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 0, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 2, 3, 0, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 1, 2, 1, 2

Offset: 0

Antti Karttunen, Feb 15 2016

The entry at row n, column k, gives the Hamming distance between binary expansions of k and A003188(n+A006068(k)). When Gray code is viewed as a traversal of vertices of an infinite dimensional hypercube by bit-flipping (see the illustration "Visualized as a traversal of vertices of a tesseract" in the Wikipedia's "Gray code" article) the argument k is the "address" (the binary code given inside each vertex) of the starting vertex, and argument n tells how many edges forward along the Gray code path we should hop from it (to the direction that leads away from the vertex with code 0000...). A(n, k) gives then the Hamming distance between the starting and the ending vertex. For how this works with case n=3, see comments in A268676. - Antti Karttunen, Mar 11 2024

			The top left [0 .. 24] X [0 .. 24] section of the array:
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
1, 3, 3, 1, 3, 1, 1, 3, 3, 1, 1, 3, 1, 3, 3, 1, 3, 1, 1, 3, 1, 3, 3, 1, 1
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
3, 1, 3, 3, 3, 3, 3, 1, 3, 3, 3, 1, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 3, 3
2, 2, 4, 4, 4, 4, 2, 2, 4, 4, 2, 2, 2, 2, 4, 4, 4, 4, 2, 2, 2, 2, 4, 4, 2
1, 3, 3, 3, 3, 3, 1, 3, 3, 3, 1, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 3, 3, 1
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3
4, 4, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 4, 4, 4, 4, 4, 4, 2, 2, 4
3, 3, 3, 1, 5, 3, 3, 5, 5, 3, 3, 5, 3, 3, 3, 1, 5, 3, 3, 5, 3, 3, 3, 1, 3
2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 4, 4, 4, 4, 2, 2, 2, 2, 2
3, 1, 3, 3, 3, 5, 5, 3, 3, 5, 5, 3, 3, 1, 3, 3, 3, 5, 5, 3, 3, 1, 3, 3, 3
2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 4, 4, 4, 4, 4, 4, 2, 2, 4, 4, 2
1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 1
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
4, 4, 4, 4, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
3, 5, 5, 3, 3, 1, 3, 3, 5, 3, 3, 5, 3, 5, 5, 3, 5, 3, 3, 5, 3, 5, 5, 3, 3
4, 4, 4, 4, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
5, 3, 3, 5, 3, 3, 3, 1, 5, 5, 5, 3, 5, 3, 5, 5, 5, 5, 5, 3, 5, 3, 5, 5, 5
4, 4, 4, 4, 4, 4, 2, 2, 6, 6, 4, 4, 4, 4, 6, 6, 6, 6, 4, 4, 4, 4, 6, 6, 4
3, 3, 3, 3, 3, 3, 1, 3, 5, 5, 3, 5, 3, 5, 5, 5, 5, 5, 3, 5, 3, 5, 5, 5, 3
2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2

Antti Karttunen, Table of n, a(n) for n = 0..32895; the first 256 antidiagonals of array
Wikipedia, Gray code.

Transpose A268834.
Main diagonal: A268835.
Column 0: A005811.
Row 0: A000004, Row 1: A000012, Row 2: A007395, Row 3: A268676.
Cf. A003188, A006068.
Cf. also A268726, A268727.

A101080[n_, k_]:= DigitCount[BitXor[n, k], 2, 1];A003188[n_]:=BitXor[n, Floor[n/2]]; A006068[n_]:=If[n<2, n, Block[{m=A006068[Floor[n/2]]}, 2m + Mod[Mod[n,2] + Mod[m, 2], 2]]]; a[r_, 0]:= 0; a[0, c_]:=c; a[r_, c_]:= A003188[1 + A006068[a[r - 1, c - 1]]]; A[r_, c_]:=A101080[c, a[r, r + c]]; Table[A[c, r - c], {r, 0, 20}, {c, 0, r}] // Flatten (* Indranil Ghosh, Apr 02 2017 *)

b(n) = if(n<1, 0, b(n\2) + n%2);
A101080(n, k) = b(bitxor(n, k));
A003188(n) = bitxor(n, n\2);
A006068(n) = if(n<2, n, {my(m = A006068(n\2)); 2*m + (n%2 + m%2)%2});
A268820(r, c) = if(r==0, c, if(c==0, 0, A003188(1 + A006068(A268820(r - 1, c - 1)))));
A(r, c) = A101080(c, A268820(r, r + c));
for(r=0, 20, for(c=0, r, print1(A(c, r - c),", ");); print();) \\ Indranil Ghosh, Apr 02 2017

up_to = 32895; \\ = binomial(1+256,2)-1.\\ A003188 and A006068 as above.
A268833sq(n, k) = hammingweight(bitxor(n,A003188(k+A006068(n))));
A268833list(up_to) = { my(v = vector(up_to), i=0); for(a=0,oo, for(col=0,a, i++; if(i > up_to, return(v)); v[i] = A268833sq(a-col,col))); (v); };
v268833 = A268833list(1+up_to);
A268833(n) = v268833[1+n]; \\ Antti Karttunen, Mar 11 2024

def A101080(n, k): return bin(n^k)[2:].count("1")
def A003188(n): return n^(n//2)
def A006068(n):
    if n<2: return n
    else:
        m=A006068(n//2)
        return 2*m + (n%2 + m%2)%2
def A268820(r, c): return c if r<1 else 0 if c<1 else A003188(1 + A006068(A268820(r - 1, c - 1)))
def a(r, c): return A101080(c, A268820(r, r + c))
for r in range(21):
    print([a(c, r - c) for c in range(r + 1)]) # Indranil Ghosh, Apr 02 2017

(define (A268833 n) (A268833bi (A002262 n) (A025581 n)))
(define (A268833bi row col) (A101080bi col (A268820bi row (+ row col))))

A(row,col) = A101080(col, A268820(row, row+col)).

A(n, k) = A101080(k, A003188(n+A006068(k))). - Antti Karttunen, Mar 11 2024

Definition simplified by Antti Karttunen, Mar 11 2024

cp's OEIS Frontend

A270028 a(n) is the smallest b >= 3 for which the base-b representation of n contains at least one 1 (or 0 if no such base exists).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A341533 Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = sqrt( Product_{a=1..n} Product_{b=1..k} (4*sin((2*a-1)*Pi/(2*n))^2 + 4*sin((2*b-1)*Pi/k)^2) ).

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

A353526 The smallest prime not dividing n, reduced modulo 4.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A036453 a(n) = d(d(d(d(d(n))))), the 5th iterate of the number-of-divisors function d = A000005, with initial value n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A212012 Triangle read by rows in which row n lists the number of states of the subshells of the n-th shell of the nuclear shell model ordered by energy level in increasing order.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A216620 Square array read by antidiagonals: T(n,k) = Sum_{c|n,d|k} phi(gcd(c,d)) for n>=1, k>=1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Sage

A065167 Table T(n,k) read by antidiagonals, where the k-th row gives the permutation t->t+k of Z, folded to N (k >= 0, n >= 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

A075117 Table by antidiagonals of generalized Lucas numbers: T(n,k) = T(n,k-1) + n*T(n,k-2) with T(n,0)=2 and T(n,1)=1.

Views

Author

Keywords

Examples

A341533 Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = sqrt( Product_{a=1..n} Product_{b=1..k} (4sin((2a-1)Pi/(2n))^2 + 4sin((2b-1)*Pi/k)^2) ).