OFFSET
1,2
COMMENTS
Conjecture: for n > 1, 4 divides a(n) iff n == 0 (mod 3), otherwise A007814(a(n)) = 1.
Conjecture is true (proof by mathematical induction). - Robert Israel, Feb 25 2020
Given the generating triangle of A176528, replace k's with prime(k); then take powers of the triangle resulting in a left-shifted vector considered as a sequence.
First few rows of the generating triangle M for this sequence:
1;
2;
2, 1;
0, 3;
0, 3, 1;
0, 0, 5;
0, 0, 5, 1;
0, 0, 0, 7;
0, 0, 0, 7, 1;
0, 0, 0, 0, 11;
0, 0, 0, 0, 11, 1;
0, 0, 0, 0, 0, 13;
0, 0, 0, 0, 0, 13, 1;
0, 0, 0, 0, 0, 0, 17;
...
Then sequence is Lim_{n->inf} M^n, the left-shifted vector considered as a sequence.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(10) = 110 = prime(5) * a(5) = 11 * 10.
a(7) = 26 = prime(3) * 4 + 6 = 5 * 4 + 6.
4 divides a(9) = 52 since 9 == 0 mod 3.
2 divides a(13) = 286 but not 4 since 13 == 1 mod 3.
PROG
(PARI) a(n) = if(n==1, 1, if (n % 2, a(n\2+1)+a(n\2)*prime(n\2), a(n/2)*prime(n/2))); \\ Michel Marcus, Dec 25 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Gary W. Adamson, Apr 24 2010
EXTENSIONS
Edited and more terms from Robert Israel, Feb 25 2020
STATUS
approved