A167165 - OEIS

A167165

Total distance which n is "catapulted" in the generation of the Catapult Sequence (A167161).

0, 0, 10, 0, 0, 4, 0, 0, 19, 272, 0, 60, 2, 0, 0, 14, 0, 16, 0, 0, 19, 0, 21, 0, 8, 0, 69, 37, 0, 302158, 107, 24, 0, 0, 366, 20, 0, 129, 0, 105, 0, 0, 0, 153, 0, 0, 917, 0, 129, 31, 0, 50, 0, 52, 27, 0, 55, 77, 0, 0, 59, 0, 61, 0, 0, 64, 0, 0, 0, 743, 0, 0, 71, 0, 73, 0, 0, 76, 26, 0, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

Whether or not this sequence is defined for all n depends on whether or not A167161 is a true permutation of the nonnegative integers (see comments under A167161).

LINKS

Andrew Weimholt, Table of n, a(n) for n = 0..2000

EXAMPLE

a(2) = 10, because 2 is catapulted by 1, 3, and 6 for a total distance of 1+3+6 = 10.

CROSSREFS

Cf. A167161 The Catapult Sequence.

Cf. A167162 The inverse permutation (conjectured) of A167161.

Cf. A167163 number of times n is catapulted in generation of A167161.

Cf. A167164 number catapulted by n in generation of A167161.

Sequence in context: A287464 A288012 A349626 * A288435 A287734 A064511

Adjacent sequences: A167162 A167163 A167164 * A167166 A167167 A167168

KEYWORD

nonn

AUTHOR

Andrew Weimholt, Oct 29 2009

STATUS

approved